A lift-and-project cutting plane algorithm for mixed 0–1 programs

1993/01/01 by Egon Balas, Sebastián Ceria, Gérard Cornuéjols · 25 citations
Computer Science · Engineering · #Formal Methods in Verification #Scheduling and Optimization Algorithms #Complexity and Algorithms in Graphs

paper · doi:10.1007/bf01581273

Cited by

• State-of-the-art review of optimization methods for short-term scheduling of batch processes
• Data-driven two-stage conic optimization with zero-one uncertainties
• Branch and Bound in Mixed Integer Linear Programming Problems: A Survey of Techniques and Trends
• Linear Programming Hierarchies Collapse under Symmetry
• Extended Formulations for Packing and Partitioning Orbitopes
• Extended Formulations for Online Linear Bandit Optimization
• The Branch-and-Bound Tree Closure
• Bi-Criteria and Approximation Algorithms for Restricted Matchings
• Some Fundamental Properties of Successive Convex Relaxation Methods on LCP and Related Problems
• When Does the Positive Semidefiniteness Constraint Help In Lifting Procedures
• Valid Inequalities for Mixed Integer Bilevel Linear Optimization Problems
• Approximating value functions via corner Benders' cuts
• Deepest Cuts for Benders Decomposition
• Bounding and Counting Linear Regions of Deep Neural Networks
• Ecole: A Library for Learning Inside MILP Solvers
• Service Time Window Design in Last-Mile Delivery
• A Near Maximum Likelihood Decoding Algorithm for MIMO Systems Based on Semi-Definite Programming
• On the split closure of the periodic timetabling polytope
• Linear vs. semidefinite extended formulations
• Large-scale Unit Commitment under uncertainty
• A Difference-of-Convex Cutting Plane Algorithm for Mixed-Binary Linear Program
• Intersection cuts for factorable MINLP
• Location and Capacity Planning of Facilities with General Service-Time Distributions Using Conic Optimization
• Disjunctive Benders Decomposition
• Lift-and-project ranks of the stable set polytope of joined a-perfect graphs