Exponential Lower Bounds on the Complexity of a Class of Dynamic Programs for Combinatorial Optimization Problems.
Agustín BompadrePublished in: Algorithmica (2012)
Keyphrases
- combinatorial optimization problems
- lower bound
- average case complexity
- combinatorial optimization
- knapsack problem
- optimization problems
- discrete optimization
- metaheuristic
- ant colony optimization
- worst case
- average case
- job shop scheduling
- upper bound
- objective function
- traveling salesman problem
- continuous optimization problems
- branch and bound
- optimal solution
- branch and bound algorithm
- job shop scheduling problem
- exact algorithms
- np hard
- quadratic assignment problem
- evolutionary algorithm
- computational complexity