Review of combinatorial optimization: packing and covering.
Gérard CornuéjolsPublished in: SIGACT News (2008)
Keyphrases
- combinatorial optimization
- combinatorial optimization problems
- traveling salesman problem
- metaheuristic
- simulated annealing
- branch and bound algorithm
- branch and bound
- optimization problems
- hard combinatorial optimization problems
- mathematical programming
- quadratic assignment problem
- graph theory
- combinatorial problems
- path relinking
- packing problem
- dynamic programming
- single machine scheduling problem
- combinatorial search