Potential reduction algorithms for structured combinatorial optimization problems.
Joost P. WarnersTamás TerlakyCornelis RoosBenjamin JansenPublished in: Oper. Res. Lett. (1997)
Keyphrases
- combinatorial optimization problems
- optimization problems
- discrete optimization
- combinatorial optimization
- knapsack problem
- metaheuristic
- ant colony optimization
- min cost
- job shop scheduling
- learning algorithm
- evolutionary algorithm
- worst case
- computational cost
- multi objective
- structured data
- significant improvement
- search space
- benchmark problems
- lower bound
- shortest path problem
- computational complexity
- data structure