Pages that link to "Item:Q2492679"
From MaRDI portal
The following pages link to A convex-analysis perspective on disjunctive cuts (Q2492679):
Displaying 14 items.
- An implementation of exact knapsack separation (Q330511) (← links)
- A computational study of the cutting plane tree algorithm for general mixed-integer linear programs (Q433830) (← links)
- Reflections on generating (disjunctive) cuts (Q458126) (← links)
- How to convexify the intersection of a second order cone and a nonconvex quadratic (Q517311) (← links)
- Computing deep facet-defining disjunctive cuts for mixed-integer programming (Q847850) (← links)
- Two-term disjunctions on the second-order cone (Q896297) (← links)
- Quasiconvex minimization on a locally finite union of convex sets (Q956610) (← links)
- A computational study of exact knapsack separation for the generalized assignment problem (Q967219) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- Refined cut selection for Benders decomposition: applied to network capacity expansion problems (Q2074837) (← links)
- ``Facet'' separation with one linear program (Q2330653) (← links)
- A note on the selection of Benders' cuts (Q2638375) (← links)
- Strong valid inequalities for orthogonal disjunctions and bilinear covering sets (Q2638385) (← links)
- Cut-Generating Functions and <i>S</i>-Free Sets (Q5252221) (← links)
