Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems.
Paolo TothPublished in: Eur. J. Oper. Res. (2000)
Keyphrases
- hard combinatorial optimization problems
- exact solution
- combinatorial optimization
- benchmark problems
- exact algorithms
- metaheuristic
- combinatorial problems
- optimization problems
- column generation
- branch and bound
- ant colony optimisation
- traveling salesman problem
- lower bound
- simulated annealing
- optimization method
- approximate solutions
- global optimization
- branch and bound algorithm
- optimal solution
- optimization algorithm
- quadratic assignment problem
- optimization methods
- genetic algorithm
- constraint programming
- neural network
- classification rules
- tabu search
- upper bound
- np hard
- evolutionary algorithm
- objective function
- orthogonal projection