A few strong knapsack facets
From MaRDI portal
Publication:5351614
DOI10.1007/978-3-319-23699-5_4zbMath1471.90119OpenAlexW2259704613MaRDI QIDQ5351614
Sunil Chopra, Daniel E. Steffy, Sang Ho Shim
Publication date: 29 August 2017
Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-23699-5_4
Integer programming (90C10) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items (2)
A concise characterization of strong knapsack facets ⋮ The worst case analysis of strong knapsack facets
Cites Work
- The worst case analysis of strong knapsack facets
- Convex hulls of superincreasing knapsacks and lexicographic orderings
- Corner polyhedra and their connection with cutting planes
- T-space and cutting planes
- Cyclic group and knapsack facets
- Cyclic group blocking polyhedra
- A 3-slope theorem for the infinite relaxation in the plane
- Binary group facets with complete support and non-binary coefficients
- Valid inequalities based on the interpolation procedure
- Some polyhedra related to combinatorial problems
- A $(k+1)$-Slope Theorem for the $k$-Dimensional Infinite Group Relaxation
- The Theory and Computation of Knapsack Functions
- Some continuous functions related to corner polyhedra
- Some continuous functions related to corner polyhedra, II
This page was built for publication: A few strong knapsack facets
