3320 search results - page 122 / 664 » Heuristics for the Phylogeny Problem |
159
click to vote
HICSS
2005
IEEE
15 years 12 months ago
2005
IEEE
In this paper we formulate a combinatorial auction brokering problem as a set packing problem and apply a simulated annealing heuristic with hybrid local moves to solve the proble...
158
click to vote
HEURISTICS
2010
15 years 1 months ago
2010
The challenge in shift scheduling lies in the construction of a set of work shifts, which are subject to specific regulations, in order to cover fluctuating staff demands. This pro...
218
click to vote
COCOA
2008
Springer
15 years 8 months ago
2008
Springer
We introduce a new combinatorial optimization problem, which is a generalization of the Traveling Salesman Problem (TSP) and which we call Traveling Salesman Problem of Second Orde...
261
Voted
AIPS
2004
15 years 7 months ago
2004
Oversubscribed scheduling problems require removing tasks when enough resources are not available. Prior AI approaches have mostly been constructive or repairbased heuristic searc...
146
click to vote
COR
2008
15 years 6 months ago
2008
The Swath Segment Selection Problem (SSSP) is an NP-hard combinatorial optimization problem arising in the context of planning and scheduling satellite operations. It was defined ...