Pages that link to "Item:Q1365045"

The following pages link to A modified lift-and-project procedure (Q1365045):

Displaying 11 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)
• 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)
• 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)