On the set covering polytope: I. All the facets with coefficients in {0, 1, 2}.
Egon BalasShu Ming NgPublished in: Math. Program. (1989)
Keyphrases
- set covering
- facet defining inequalities
- set covering problem
- column generation
- facet defining
- integer programming
- linear combination
- stable set
- basis functions
- lattice points
- wavelet coefficients
- hypergraph model
- crew pairing
- convex hull
- wavelet packet
- mixed integer
- computational complexity
- special case
- multi objective
- integer program
- search algorithm
- combinatorial auctions
- constraint programming