A polyhedral study on 0-1 knapsack problems with set packing constraints
From MaRDI portal
Publication:1785756
DOI10.1016/j.orl.2016.01.011zbMath1408.90187OpenAlexW2287267874MaRDI QIDQ1785756
Mercedes Landete, Roberto J. Cañavate
Publication date: 1 October 2018
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2016.01.011
Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items (1)
Cites Work
- Unnamed Item
- A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: strong valid inequalities by sequence-independent lifting
- A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting
- Stochastic set packing problem
- A class of facet producing graphs for vertex packing polyhedra
- On the \(0/1\) knapsack polytope
- Wheel inequalities for stable set polytopes
- The capacitated multiple allocation hub location problem: Formulations and algorithms
- An \(O(n \log n)\) procedure for identifying facets of the knapsack polytope.
- Lifted cover facets of the 0-1 knapsack polytope with GUB constraints
- Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints
- Combinatorial Auctions: A Survey
- Easily Computable Facets of the Knapsack Polytope
- (1,k)-configurations and facets for packing problems
- Facets of the knapsack polytope
- Facets of the Knapsack Polytope From Minimal Covers
- Facet Obtaining Procedures for Set Packing Problems
- On the facial structure of set packing polyhedra
- New facets for the set packing polytope
This page was built for publication: A polyhedral study on 0-1 knapsack problems with set packing constraints
