Pages that link to "Item:Q543404"
From MaRDI portal
The following pages link to On the separation of disjunctive cuts (Q543404):
Displaying 27 items.
- Bilevel programming and the separation problem (Q403662) (← links)
- Reflections on generating (disjunctive) cuts (Q458126) (← links)
- Strong-branching inequalities for convex mixed integer nonlinear programs (Q480939) (← links)
- Using symmetry to optimize over the Sherali-Adams relaxation (Q482114) (← 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)
- Reformulating the disjunctive cut generating linear program (Q827289) (← links)
- Lift-and-project cuts for convex mixed integer nonlinear programs (Q1697971) (← links)
- Monoidal cut strengthening and generalized mixed-integer rounding for disjunctions and complementarity constraints (Q1728353) (← links)
- Generalized intersection cuts and a new cut generating paradigm (Q1942255) (← links)
- An L-shaped method with strengthened lift-and-project cuts (Q2109005) (← links)
- SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs (Q2164703) (← links)
- Split cuts from sparse disjunctions (Q2195684) (← links)
- ``Facet'' separation with one linear program (Q2330653) (← links)
- On optimizing over lift-and-project closures (Q2392660) (← links)
- Cutting planes from two-term disjunctions (Q2450685) (← links)
- A convex-analysis perspective on disjunctive cuts (Q2492679) (← links)
- Computational Experiments with Cross and Crooked Cross Cuts (Q2940067) (← links)
- Lift-and-Project Cuts for Mixed Integer Convex Programs (Q3009750) (← links)
- (Q4501593) (← links)
- (Q4537754) (← links)
- Implementing Automatic Benders Decomposition in a Modern MIP Solver (Q5041736) (← links)
- Lattice Reformulation Cuts (Q5162650) (← links)
- On disjunctive cuts for combinatorial optimization (Q5952319) (← links)
- On dijoins (Q5957710) (← links)
- Disjunctive cuts in mixed-integer conic optimization (Q6038657) (← links)
- On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs (Q6589745) (← links)
