Quadratic Combinatorial Optimization Using Separable Underestimators.
Christoph BuchheimEmiliano TraversiPublished in: INFORMS J. Comput. (2018)
Keyphrases
- combinatorial optimization
- combinatorial optimization problems
- traveling salesman problem
- simulated annealing
- metaheuristic
- branch and bound algorithm
- combinatorial problems
- branch and bound
- optimization problems
- objective function
- pairwise
- mathematical programming
- graph theory
- computational complexity
- quadratic assignment problem
- vehicle routing problem
- hard combinatorial optimization problems
- dynamic programming
- memetic algorithm
- neural network
- combinatorial search
- max flow min cut
- job shop scheduling problem
- tabu search
- genetic algorithm