Representations of quadratic combinatorial optimization problems: A case study using the quadratic set covering problem.
Abraham P. PunnenPooja PandeyPublished in: CoRR (2018)
Keyphrases
- combinatorial optimization problems
- set covering problem
- combinatorial optimization
- knapsack problem
- optimization problems
- branch and bound algorithm
- objective function
- set covering
- metaheuristic
- job shop scheduling
- ant colony optimization
- discrete optimization
- upper bound
- dynamic programming
- traveling salesman problem
- particle swarm optimization
- evolutionary algorithm