Sciweavers

3433 search results - page 68 / 687
» Heuristics for a bidding problem
Sort
View
AI
2009
Springer
14 years 2 months ago
STFLS: A Heuristic Method for Static and Transportation Facility Location Allocation in Large Spatial Datasets
Abstract. This paper solves a static and transportation facility location allocation problem defined as follows: given a set of locations Loc and a set of demand objects D located ...
Wei Gu, Xin Wang, Liqiang Geng
MICAI
2004
Springer
14 years 1 months ago
A Preprocessing That Combines Heuristic and Surrogate Constraint Analysis to Fix Variables in TSP
A preprocessing procedure that uses a local guided search defined in terms of a neighborhood structure to get a feasible solution (UB) and the Osorio and Glover[18, 20] exploiting ...
María Auxilio Osorio Lama, David Pinto
BMCBI
2008
121views more  BMCBI 2008»
13 years 7 months ago
A simple and fast heuristic for protein structure comparison
Background: Protein structure comparison is a key problem in bioinformatics. There exist several methods for doing protein comparison, being the solution of the Maximum Contact Ma...
David A. Pelta, Juan Ramón González,...
EVOW
2007
Springer
14 years 1 months ago
Reducing the Size of Traveling Salesman Problem Instances by Fixing Edges
Abstract. The Traveling Salesman Problem (TSP) is a well-known NPhard combinatorial optimization problem, for which a large variety of evolutionary algorithms are known. However, t...
Thomas Fischer, Peter Merz
HEURISTICS
2006
197views more  HEURISTICS 2006»
13 years 7 months ago
Bucket elimination for multiobjective optimization problems
Multiobjective optimization deals with problems involving multiple measures of performance that should be optimized simultaneously. In this paper we extend bucket elimination (BE),...
Emma Rollon, Javier Larrosa