A Cutting-Plane Algorithm for the Quadratic Set-Covering Problem.
Mokhtar S. BazaraaJamie J. GoodePublished in: Oper. Res. (1975)
Keyphrases
- set covering problem
- cutting plane algorithm
- integer programming
- column generation
- cutting plane
- valid inequalities
- set covering
- linear programming
- lagrangian relaxation
- np hard
- constraint programming
- branch and bound algorithm
- network flow
- branch and bound
- pairwise
- computational complexity
- objective function
- integer program
- mixed integer programming
- linear program
- maximum margin
- optimal solution
- vehicle routing problem with time windows
- feasible solution
- max flow
- np complete
- evolutionary algorithm