A modified lift-and-project procedure

DOI10.1007/BF02614309zbMath0887.90127OpenAlexW2003276565MaRDI QIDQ1365045

Egon Balas

Publication date: 25 May 1998

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02614309

zbMATH Keywords

disjunctive programmingconvexificationbranch-and-cutcut generating linear programlift-and-project approach

Mathematics Subject Classification ID

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

Related Items

Reformulating the disjunctive cut generating linear program, Implementing Automatic Benders Decomposition in a Modern MIP Solver, A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation, Lift-and-project cuts for convex mixed integer nonlinear programs, Strong-branching inequalities for convex mixed integer nonlinear programs, Two-Stage Stochastic Mixed-Integer Programs: Algorithms and Insights, Lift-and-project for mixed 0-1 programming: recent progress, On the separation of disjunctive cuts, The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification, Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem, Projection, lifting and extended formulation integer and combinatorial optimization

Uses Software

• ABACUS

Cites Work

• Unnamed Item
• Disjunctive programming: Properties of the convex hull of feasible points
• Computational experience with parallel mixed integer programming in a distributed environment
• 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
• Disjunctive Programming
• Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework