Pages that link to "Item:Q1365045"
From MaRDI portal
The following pages link to A modified lift-and-project procedure (Q1365045):
Displaying 18 items.
- Strong-branching inequalities for convex mixed integer nonlinear programs (Q480939) (← links)
- On the separation of disjunctive cuts (Q543404) (← links)
- Lift-and-project for mixed 0-1 programming: recent progress (Q697568) (← links)
- Projection, lifting and extended formulation integer and combinatorial optimization (Q817203) (← links)
- Reformulating the disjunctive cut generating linear program (Q827289) (← links)
- Local cuts revisited (Q1003489) (← links)
- Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants (Q1043853) (← links)
- A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming (Q1411611) (← links)
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem (Q1602704) (← links)
- Lift-and-project cuts for convex mixed integer nonlinear programs (Q1697971) (← links)
- A new lift-and-project operator (Q1752818) (← links)
- Convex normalizations in lift-and-project methods for 0--1 programming (Q1854777) (← links)
- A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming (Q2097632) (← links)
- Elevators for degenerations of PEL structures (Q2428822) (← links)
- The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification (Q2570997) (← links)
- Two-Stage Stochastic Mixed-Integer Programs: Algorithms and Insights (Q3565463) (← links)
- Implementing Automatic Benders Decomposition in a Modern MIP Solver (Q5041736) (← links)
- A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation (Q5106379) (← links)
