On the set covering polytope: II. Lifting the facets with coefficients in {0, 1, 2}.
Egon BalasShu Ming NgPublished in: Math. Program. (1989)
Keyphrases
- knapsack problem
- set covering
- facet defining
- facet defining inequalities
- set covering problem
- np hard
- integer programming
- dynamic programming
- wavelet transform
- wavelet coefficients
- column generation
- linear combination
- valid inequalities
- basis functions
- crew pairing
- multiresolution
- combinatorial auctions
- integer program
- denoising
- cost function