Pages that link to "Item:Q543404"
From MaRDI portal
The following pages link to On the separation of disjunctive cuts (Q543404):
Displaying 15 items.
- Bilevel programming and the separation problem (Q403662) (← 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)
- Reformulating the disjunctive cut generating linear program (Q827289) (← links)
- Lift-and-project cuts for convex mixed integer nonlinear programs (Q1697971) (← 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)
- Computational Experiments with Cross and Crooked Cross Cuts (Q2940067) (← links)
- Lift-and-Project Cuts for Mixed Integer Convex Programs (Q3009750) (← links)
- Disjunctive cuts in mixed-integer conic optimization (Q6038657) (← links)
