Extended formulations in combinatorial optimization.
Michele ConfortiGérard CornuéjolsGiacomo ZambelliPublished in: Ann. Oper. Res. (2013)
Keyphrases
- combinatorial optimization
- traveling salesman problem
- simulated annealing
- combinatorial optimization problems
- metaheuristic
- branch and bound
- mathematical programming
- branch and bound algorithm
- optimization problems
- combinatorial problems
- hard combinatorial optimization problems
- quadratic assignment problem
- graph theory
- memetic algorithm
- max flow min cut
- exact algorithms
- genetic programming
- optimization methods
- vehicle routing problem
- combinatorial search
- genetic algorithm
- valid inequalities
- single machine scheduling problem
- multi objective