Approximate Local Search in Combinatorial Optimization.
James B. OrlinAbraham P. PunnenAndreas S. SchulzPublished in: SIAM J. Comput. (2004)
Keyphrases
- combinatorial optimization
- traveling salesman problem
- simulated annealing
- combinatorial optimization problems
- metaheuristic
- branch and bound algorithm
- mathematical programming
- branch and bound
- hard combinatorial optimization problems
- optimization problems
- combinatorial problems
- memetic algorithm
- job shop scheduling problem
- exact solution
- quadratic assignment problem
- combinatorial search
- vehicle routing problem
- tabu search
- cost function