The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems.
Marcel TurkensteenDmitriy S. MalyshevBoris GoldengorinPanos M. PardalosPublished in: J. Glob. Optim. (2017)
Keyphrases
- lower bound
- combinatorial optimization problems
- knapsack problem
- optimization problems
- metaheuristic
- discrete optimization
- combinatorial optimization
- optimal solution
- objective function
- traveling salesman problem
- ant colony optimization
- job shop scheduling problem
- shortest path problem
- continuous optimization problems
- job shop scheduling
- vehicle routing problem
- search space
- min cost
- exact algorithms
- minmax regret
- constraint satisfaction problems
- search algorithm