Pages that link to "Item:Q697568"
From MaRDI portal
The following pages link to Lift-and-project for mixed 0-1 programming: recent progress (Q697568):
Displaying 41 items.
- Solving disjunctive optimization problems by generalized semi-infinite optimization techniques (Q301738) (← links)
- A computational study of the cutting plane tree algorithm for general mixed-integer linear programs (Q433830) (← links)
- On linear programs with linear complementarity constraints (Q452341) (← links)
- On the separation of disjunctive cuts (Q543404) (← links)
- Enhanced mixed integer programming techniques and routing problems (Q657574) (← links)
- Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs (Q691415) (← links)
- Projection, lifting and extended formulation integer and combinatorial optimization (Q817203) (← links)
- Reformulating the disjunctive cut generating linear program (Q827289) (← links)
- Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation (Q1019294) (← links)
- A modified lift-and-project procedure (Q1365045) (← links)
- A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming (Q1411611) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- Global optimization of disjunctive programs (Q1679482) (← links)
- A new lift-and-project operator (Q1752818) (← links)
- Convex normalizations in lift-and-project methods for 0--1 programming (Q1854777) (← links)
- A branch-and-cut method for 0-1 mixed convex programming (Q1968795) (← links)
- A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming (Q2097632) (← links)
- Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables (Q2164683) (← links)
- Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design (Q2273684) (← links)
- On solving two-stage distributionally robust disjunctive programs with a general ambiguity set (Q2312325) (← links)
- ``Facet'' separation with one linear program (Q2330653) (← links)
- Lift-and-project for general two-term disjunctions (Q2339813) (← links)
- MIPping closures: An instant survey (Q2373443) (← links)
- On optimizing over lift-and-project closures (Q2392660) (← links)
- Disjunctive cuts for continuous linear bilevel programming (Q2463829) (← links)
- Exact MAX-2SAT solution via lift-and-project closure (Q2466587) (← links)
- Optimizing over the split closure (Q2476990) (← links)
- A convex-analysis perspective on disjunctive cuts (Q2492679) (← links)
- The strength of multi-row models (Q2516350) (← links)
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting (Q2576248) (← links)
- Benders decomposition for network design covering problems (Q2669611) (← links)
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs (Q2897292) (← links)
- Lift-and-Project Cuts for Mixed Integer Convex Programs (Q3009750) (← links)
- Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints (Q3454970) (← links)
- Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework (Q4363673) (← links)
- Implementing Automatic Benders Decomposition in a Modern MIP Solver (Q5041736) (← links)
- Using Two-Dimensional Projections for Stronger Separation and Propagation of Bilinear Terms (Q5110560) (← links)
- STEP-compliant process planning system for compound sheet metal machining (Q5444596) (← links)
- Disjunctive cuts in mixed-integer conic optimization (Q6038657) (← links)
- Improving the scheduling of railway maintenance projects by minimizing passenger delays subject to event requests of railway operators (Q6561224) (← links)
- Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables (Q6589754) (← links)
