Subset Coefficient Reduction Cuts for 0/1 Mixed-Integer Programming

DOI10.1287/opre.33.3.505zbMath0583.90075OpenAlexW2078119686MaRDI QIDQ3706846

Linus Schrage, R. Kipp Martin

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

zbMATH Keywords

cutting planefixed-charge problemsmixed-integer 0-1 programssubset coefficient reduction

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Mixed integer programming (90C11)

Related Items

Lattice based extended formulations for integer linear equality systems ⋮ Strong formulations for mixed integer programming: A survey ⋮ Valid inequalities and separation for capacitated fixed charge flow problems ⋮ Efficient reformulation for 0-1 programs -- methods and computational results ⋮ Valid inequalities and facets of the capacitated plant location problem