Some basic exchange properties in combinatorial optimization and their application to constructing the K-best solutions.
Ulrich DerigsPublished in: Discret. Appl. Math. (1985)
Keyphrases
- combinatorial optimization
- combinatorial problems
- metaheuristic
- traveling salesman problem
- combinatorial optimization problems
- branch and bound
- simulated annealing
- optimal solution
- optimization problems
- benchmark problems
- branch and bound algorithm
- exact algorithms
- vehicle routing problem
- tabu search
- combinatorial search
- hard combinatorial optimization problems
- max flow min cut
- genetic algorithm
- worst case
- dynamic programming
- special case
- evolutionary algorithm
- lower bound
- search algorithm
- objective function