A computational study of the cutting plane tree algorithm for general mixed-integer linear programs

DOI10.1016/J.ORL.2011.10.009MaRDI QIDQ433830zbMATH OpenOpenAlexFDO

Authors Binyuan Chen, Simge Küçükyavuz, Suvrajeet Sen

Publication date 6 July 2012

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.orl.2011.10.009

zbMATH Keywords

cutting plane algorithmmulti-term disjunctions

Mathematics Subject Classification ID

Linear programming (90C05) Mixed integer programming (90C11)

Recommendations

• A disjunctive cutting plane procedure for general mixed-integer linear programs
• A simple finite cutting plane algorithm for integer programs
• scientific article; zbMATH DE number 2084777
• Finite Disjunctive Programming Characterizations for General Mixed-Integer Linear Programs
• Computational Integer Programming and Cutting Planes

Cites work

• scientific article; zbMATH DE number 1757966 (Why is no real title available?)
• A convex-analysis perspective on disjunctive cuts
• A disjunctive cutting plane procedure for general mixed-integer linear programs
• A heuristic to generate rank-1 GMI cuts
• A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems
• Computing deep facet-defining disjunctive cuts for mixed-integer programming
• Convex normalizations in lift-and-project methods for 0--1 programming
• Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming
• Disjunctive Programming
• Finite Disjunctive Programming Characterizations for General Mixed-Integer Linear Programs
• Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants
• Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs
• Lexicography and degeneracy: Can a pure cutting plane algorithm work?
• Lift-and-project for mixed 0-1 programming: recent progress
• MIPLIB 2003
• MIR closures of polyhedral sets
• Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
• Optimization with disjunctive constraints
• Optimizing over the split closure
• Partial convexification cuts for 0--1 mixed-integer programs
• Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation

Cited in

(8)

• A disjunctive cutting plane procedure for general mixed-integer linear programs
• Testing cut generators for mixed-integer linear programming
• Unified branch-and-Benders-cut for two-stage stochastic mixed-integer programs
• Decomposition methods for global solution of mixed-integer linear programs
• Cutting plane algorithms for the inverse mixed integer linear programming problem
• Theoretical challenges towards cutting-plane selection
• The ancestral Benders' cutting plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming
• Optimal crashing of an activity network with disruptions

Describes a project that uses

Uses Software

• MIPLIB
• MIPLIB2003

This page was built for publication: A computational study of the cutting plane tree algorithm for general mixed-integer linear programs

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