223 search results - page 1 / 45 » Approximate local search in combinatorial optimization |
SODA
2004
ACM
13 years 6 months ago
2004
ACM
srn.com/abstract=423560
EOR
2002
13 years 5 months ago
2002
The paper presents a new genetic local search algorithm for multi-objective combinatorial optimization. The goal of the algorithm is to generate in a short time a set of approxima...
AAAI
2000
13 years 6 months ago
2000
Depth-first branch-and-bound (DFBnB) is a complete algorithm that is typically used to find optimal solutions of difficult combinatorial optimization problems. It can also be adap...
IDA
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. Since minimum sum-of-squares clustering (MSSC) is an NPhard combinatorial optimization problem, applying techniques from global optimization appears to be promising for r...
GECCO
2008
Springer
13 years 6 months ago
2008
Springer
We first present a method, called Two-Phase Pareto Local Search, to find a good approximation of the efficient set of the biobjective traveling salesman problem. In the first p...