On the role of bottleneck Monge matrices in combinatorial optimization.
Rainer E. BurkardPublished in: Oper. Res. Lett. (1995)
Keyphrases
- combinatorial optimization
- traveling salesman problem
- combinatorial optimization problems
- simulated annealing
- metaheuristic
- optimization problems
- mathematical programming
- combinatorial problems
- submodular functions
- branch and bound algorithm
- branch and bound
- hard combinatorial optimization problems
- quadratic assignment problem
- graph theory
- memetic algorithm
- exact algorithms
- neural network
- vehicle routing problem
- combinatorial search
- cost function