Lift-and-project for mixed 0-1 programming: recent progress

DOI10.1016/S0166-218X(01)00340-7zbMath1076.90031MaRDI QIDQ697568

Michael Perregaard, Egon Balas

Publication date: 17 September 2002

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Mixed integer programming (90C11) Boolean programming (90C09)

Related Items (30)

Reformulating the disjunctive cut generating linear program ⋮ Implementing Automatic Benders Decomposition in a Modern MIP Solver ⋮ Algorithms and Software for Convex Mixed Integer Nonlinear Programs ⋮ MIPping closures: An instant survey ⋮ Solving disjunctive optimization problems by generalized semi-infinite optimization techniques ⋮ Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints ⋮ Theoretical challenges towards cutting-plane selection ⋮ On optimizing over lift-and-project closures ⋮ Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables ⋮ Benders decomposition for network design covering problems ⋮ Global optimization of disjunctive programs ⋮ Disjunctive cuts in mixed-integer conic optimization ⋮ Using Two-Dimensional Projections for Stronger Separation and Propagation of Bilinear Terms ⋮ A computational study of the cutting plane tree algorithm for general mixed-integer linear programs ⋮ On linear programs with linear complementarity constraints ⋮ Enhanced mixed integer programming techniques and routing problems ⋮ Disjunctive cuts for continuous linear bilevel programming ⋮ Exact MAX-2SAT solution via lift-and-project closure ⋮ Lift-and-Project Cuts for Mixed Integer Convex Programs ⋮ Optimizing over the split closure ⋮ On the separation of disjunctive cuts ⋮ A convex-analysis perspective on disjunctive cuts ⋮ Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design ⋮ STEP-compliant process planning system for compound sheet metal machining ⋮ The strength of multi-row models ⋮ Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation ⋮ On solving two-stage distributionally robust disjunctive programs with a general ambiguity set ⋮ ``Facet separation with one linear program ⋮ A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting ⋮ Lift-and-project for general two-term disjunctions

Uses Software

• ABACUS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Representability in mixed integer programming. I: Characterization results
• Optimization with disjunctive constraints
• Strengthening cuts for mixed integer programs
• Facial disjunctive programs and sequences of cutting-planes
• An algorithm for disjunctive programs
• Logic-based decision support. Mixed integer model formulation
• Disjunctive programming: Properties of the convex hull of feasible points
• An alternative explanation of disjunctive formulations
• A modified lift-and-project procedure
• Computational experience with parallel mixed integer programming in a distributed environment
• Sequential convexification in reverse convex and disjunctive programming
• A branch-and-cut method for 0-1 mixed convex programming
• Convex programming for disjunctive convex optimization
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
• Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
• Cones of Matrices and Set-Functions and 0–1 Optimization
• Two Rules for Deducing Valid Inequalities for 0-1 Problems
• Disjunctive Programming
• Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework

This page was built for publication: Lift-and-project for mixed 0-1 programming: recent progress