On the 0, 1 facets of the set covering polytope.
Gérard CornuéjolsAntonio SassanoPublished in: Math. Program. (1989)
Keyphrases
- set covering
- facet defining inequalities
- facet defining
- integer programming
- valid inequalities
- set covering problem
- lattice points
- column generation
- stable set
- integer program
- convex hull
- crew pairing
- hypergraph model
- cost function
- extreme points
- combinatorial auctions
- directed graph
- semidefinite
- mixed integer
- knapsack problem