376 search results - page 13 / 76 » Solution Counting Algorithms for Constraint-Centered Search ... |
EOR
2008
13 years 7 months ago
2008
We study the one-machine scheduling problem with release dates and we look at several objective functions including total (weighted) tardiness and total (weighted) completion time...
ICTAI
2006
IEEE
14 years 1 months ago
2006
IEEE
Standard tabu search methods are based on the complete exploration of current solution neighborhood. However, for some problems with very large neighborhood or time-consuming eval...
EOR
2010
13 years 7 months ago
2010
This study investigates an optimization-based heuristic for the Robotic Cell Problem. This problem arises in automated cells and is a complex ow shop problem with a single transpo...
OR
2005
Springer
14 years 1 months ago
2005
Springer
In the open route version of the well-known vehicle routing problem, vehicles are not required to return to the depot; or if they are required, then they return by traveling the sa...
PPL
2010
13 years 2 months ago
2010
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...