Lift-and-project for mixed 0-1 programming: recent progress
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1187158 (Why is no real title available?)
- scientific article; zbMATH DE number 3559278 (Why is no real title available?)
- scientific article; zbMATH DE number 956840 (Why is no real title available?)
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- A branch-and-cut method for 0-1 mixed convex programming
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- A modified lift-and-project procedure
- An algorithm for disjunctive programs
- An alternative explanation of disjunctive formulations
- Computational experience with parallel mixed integer programming in a distributed environment
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Convex programming for disjunctive convex optimization
- Disjunctive Programming
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- Disjunctive programming: Properties of the convex hull of feasible points
- Facial disjunctive programs and sequences of cutting-planes
- Logic-based decision support. Mixed integer model formulation
- Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
- Optimization with disjunctive constraints
- Representability in mixed integer programming. I: Characterization results
- Sequential convexification in reverse convex and disjunctive programming
- Strengthening cuts for mixed integer programs
- Two Rules for Deducing Valid Inequalities for 0-1 Problems
Cited in
(43)- Optimizing over the split closure
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
- scientific article; zbMATH DE number 1187158 (Why is no real title available?)
- Reformulating the disjunctive cut generating linear program
- Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables
- 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
- Lift-and-project for general two-term disjunctions
- MIPping closures: An instant survey
- A branch-and-cut method for 0-1 mixed convex programming
- A convex-analysis perspective on disjunctive cuts
- Projection, lifting and extended formulation integer and combinatorial optimization
- scientific article; zbMATH DE number 437548 (Why is no real title available?)
- Benders decomposition for network design covering problems
- An in-out approach to disjunctive optimization
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- On optimizing over lift-and-project closures
- A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming
- Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs
- The strength of multi-row models
- STEP-compliant process planning system for compound sheet metal machining
- Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation
- Convex normalizations in lift-and-project methods for 0--1 programming
- On the separation of disjunctive cuts
- ``Facet separation with one linear program
- Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design
- Solving disjunctive optimization problems by generalized semi-infinite optimization techniques
- Exact MAX-2SAT solution via lift-and-project closure
- Enhanced mixed integer programming techniques and routing problems
- Disjunctive cuts in mixed-integer conic optimization
- On linear programs with linear complementarity constraints
- Disjunctive programming
- On solving two-stage distributionally robust disjunctive programs with a general ambiguity set
- Theoretical challenges towards cutting-plane selection
- Implementing automatic benders decomposition in a modern MIP solver
- A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming
- A new lift-and-project operator
- Lift-and-project cuts for mixed integer convex programs
- Improving the scheduling of railway maintenance projects by minimizing passenger delays subject to event requests of railway operators
- Obtaining tighter relaxations of mathematical programs with complementarity constraints
- Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables
- Global optimization of disjunctive programs
- Disjunctive cuts for continuous linear bilevel programming
This page was built for publication: Lift-and-project for mixed 0-1 programming: recent progress
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q697568)
