Cardinality constrained combinatorial optimization: Complexity and polyhedra.
Rüdiger StephanPublished in: Discret. Optim. (2010)
Keyphrases
- combinatorial optimization
- combinatorial optimization problems
- traveling salesman problem
- simulated annealing
- branch and bound
- optimization problems
- metaheuristic
- branch and bound algorithm
- quadratic assignment problem
- combinatorial problems
- mathematical programming
- exact algorithms
- memetic algorithm
- path relinking
- vehicle routing problem
- single machine scheduling problem
- space complexity
- special case
- lower bound
- combinatorial search
- multiscale
- max flow min cut
- graph theory
- knapsack problem
- worst case
- computational complexity