Stronger Inequalities for 0, 1 Integer Programming Using Knapsack Functions
From MaRDI portal
Publication:5646679
DOI10.1287/opre.19.6.1374zbMath0236.90056OpenAlexW1968837229MaRDI QIDQ5646679
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
Related Items
Coefficient strengthening: a tool for reformulating mixed-integer programs, Some aspects of integer programming duality, Coefficient reduction for inequalities in 0–1 variables, Applying a modified coefficient reduction method to a dynamic production scheduling model, Efficient reformulation for 0-1 programs -- methods and computational results, The multidimensional 0-1 knapsack problem -- bounds and computational aspects