Approximate local search in combinatorial optimization.
James B. OrlinAbraham P. PunnenAndreas S. SchulzPublished in: SODA (2004)
Keyphrases
- combinatorial optimization
- simulated annealing
- combinatorial optimization problems
- traveling salesman problem
- branch and bound
- metaheuristic
- branch and bound algorithm
- combinatorial problems
- memetic algorithm
- mathematical programming
- optimization problems
- quadratic assignment problem
- exact algorithms
- graph theory
- hard combinatorial optimization problems
- path relinking
- combinatorial search
- job shop scheduling problem
- vehicle routing problem
- tabu search
- evolutionary algorithm
- exact solution
- search algorithm
- linear programming
- multi objective