Pages that link to "Item:Q6038657"
From MaRDI portal
The following pages link to Disjunctive cuts in mixed-integer conic optimization (Q6038657):
Displaying 13 items.
- Monoidal cut strengthening revisited (Q435731) (← links)
- Intersection cuts from multiple rows: a disjunctive programming approach (Q458123) (← links)
- On the separation of disjunctive cuts (Q543404) (← links)
- Computing deep facet-defining disjunctive cuts for mixed-integer programming (Q847850) (← links)
- Monoidal cut strengthening and generalized mixed-integer rounding for disjunctions and complementarity constraints (Q1728353) (← links)
- A complete characterization of disjunctive conic cuts for mixed integer second order cone optimization (Q1751214) (← links)
- On pathological disjunctions and redundant disjunctive conic cuts (Q2294223) (← links)
- Disjunctive cuts for continuous linear bilevel programming (Q2463829) (← links)
- A convex-analysis perspective on disjunctive cuts (Q2492679) (← links)
- Disjunctive Cuts for Nonconvex MINLP (Q2897296) (← links)
- Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs (Q3503837) (← links)
- Integer Programming and Combinatorial Optimization (Q5712451) (← links)
- On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs (Q6589745) (← links)