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

DOI10.1287/OPRE.33.3.505MaRDI QIDQ3706846zbMATH OpenOpenAlexFDO

Authors Linus Schrage, 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)

Recommendations

• Zero-coefficient cuts
• Cutting planes in integer and mixed integer programming
• Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
• scientific article; zbMATH DE number 1953199
• scientific article; zbMATH DE number 437548

Cited in

(12)

• Strong formulations for mixed integer programming: A survey
• Valid inequalities and facets of the capacitated plant location problem
• Some properties of cliques in 0-1 mixed integer programs
• Efficient reformulation for 0-1 programs -- methods and computational results
• A recursive procedure to generate all cuts for 0-1 mixed integer programs
• Valid inequalities and separation for capacitated fixed charge flow problems
• Zero-coefficient cuts
• Variablenfixierungen in gemischt-ganzzahligen linearen 0-1-Optimierungsaufgaben
• Subset Algebra Lift Operators for 0-1 Integer Programming
• Generalized coefficient strengthening cuts for mixed integer programming
• Lattice based extended formulations for integer linear equality systems
• Coefficient strengthening: a tool for reformulating mixed-integer programs

This page was built for publication: Subset Coefficient Reduction Cuts for 0/1 Mixed-Integer Programming

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