Subset Coefficient Reduction Cuts for 0/1 Mixed-Integer Programming
From MaRDI portal
Publication:3706846
DOI10.1287/opre.33.3.505zbMath0583.90075MaRDI QIDQ3706846
Publication date: 1985
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.33.3.505
Related Items
Lattice based extended formulations for integer linear equality systems, Strong formulations for mixed integer programming: A survey, Valid inequalities and facets of the capacitated plant location problem, Efficient reformulation for 0-1 programs -- methods and computational results, Valid inequalities and separation for capacitated fixed charge flow problems