Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems.
Carlton E. LemkeH. M. SalkinKurt SpielbergPublished in: Oper. Res. (1971)
Keyphrases
- set covering
- linear programming
- integer programming
- column generation
- set covering problem
- np hard
- dynamic programming
- linear program
- lagrangian relaxation
- search space
- optimization problems
- data sets
- constraint propagation
- primal dual
- nonlinear programming
- crew pairing
- branch and bound algorithm
- quadratic programming
- shortest path
- objective function
- genetic algorithm
- neural network