A concise characterization of strong knapsack facets

DOI10.1016/j.dam.2018.05.006zbMath1411.90291OpenAlexW2806603430MaRDI QIDQ1634771

Daniel E. Steffy, Sunil Chopra, Sang Ho Shim

Publication date: 18 December 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2018.05.006

zbMATH Keywords

integer programmingknapsack facetsshooting experiment2-slope facetcyclic group problem

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Related Items

A strong formulation for the graph partition problem

Cites Work

• Unnamed Item
• The worst case analysis of strong knapsack facets
• Polarity and the complexity of the shooting experiment
• Corner polyhedra and their connection with 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
• A Polyhedral Study of the Mixed Integer Cut
• A few strong knapsack facets
• Some continuous functions related to corner polyhedra
• Some continuous functions related to corner polyhedra, II