Stronger Inequalities for 0, 1 Integer Programming Using Knapsack Functions

DOI10.1287/OPRE.19.6.1374MaRDI QIDQ5646679zbMATH OpenOpenAlexFDO

Authors Ferydoon Kianfar

Publication date 1971

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.19.6.1374

Mathematics Subject Classification ID

Integer programming (90C10)

Cited in

(6)

• Applying a modified coefficient reduction method to a dynamic production scheduling model
• Some aspects of integer programming duality
• Coefficient strengthening: a tool for reformulating mixed-integer programs
• Efficient reformulation for 0-1 programs -- methods and computational results
• Coefficient reduction for inequalities in 0–1 variables
• The multidimensional 0-1 knapsack problem -- bounds and computational aspects

This page was built for publication: Stronger Inequalities for 0, 1 Integer Programming Using Knapsack Functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5646679)