The Complexity of Combinatorial Optimization Problems on d-Dimensional Boxes.
Miroslav ChlebíkJanka ChlebíkováPublished in: SIAM J. Discret. Math. (2007)
Keyphrases
- combinatorial optimization problems
- optimization problems
- combinatorial optimization
- knapsack problem
- metaheuristic
- ant colony optimization
- discrete optimization
- job shop scheduling
- shortest path problem
- traveling salesman problem
- continuous optimization problems
- worst case
- computational complexity
- objective function
- exact algorithms
- multi dimensional
- job shop scheduling problem
- evolutionary algorithm
- min cost
- minmax regret
- linear programming
- information retrieval systems
- graph matching
- dynamic programming
- search space
- lower bound
- genetic algorithm