Sciweavers

3320 search results - page 14 / 664
» Heuristics for the Phylogeny Problem
Sort
View
COR
2006
86views more  COR 2006»
13 years 10 months ago
Heuristics for a bidding problem
In this paper, we study a bidding problem which can be modeled as a set packing problem. A simulated annealing heuristic with three local moves, including an embedded branch-and-b...
Yunsong Guo, Andrew Lim, Brian Rodrigues, Yi Zhu
GECCO
2007
Springer
167views Optimization» more  GECCO 2007»
14 years 4 months ago
Genetically designed heuristics for the bin packing problem
The bin packing problem (BPP) is a real-world problem that arises in different industrial applications related to minimization of space or time. The aim of this research is to au...
Oana Muntean
COR
2002
58views more  COR 2002»
13 years 10 months ago
Fast heuristics for large scale covering-location problems
We propose fast heuristics for large-scale covering-location problems in which the set of demand points is discrete and the set of potential location sites is continuous. These he...
Luce Brotcorne, Gilbert Laporte, Fréd&eacut...
AMAI
2004
Springer
14 years 3 months ago
Heuristics for a Brokering Set Packing Problem
In this paper we formulate the combinatorial auction brokering problem as a Set Packing Problem (SPP) and apply a simulated annealing heuristic to solve SPP. Experimental results ...
Yunsong Guo, Andrew Lim, Brian Rodrigues, Yi Zhu
COR
1999
99views more  COR 1999»
13 years 9 months ago
Applications of modern heuristic search methods to pattern sequencing problems
This article describes applications of modern heuristic search methods to pattern sequencing problems, i.e., problems seeking for a permutation of the rows of a given matrix with r...
Andreas Fink, Stefan Voß