Pages that link to "Item:Q847850"
From MaRDI portal
The following pages link to Computing deep facet-defining disjunctive cuts for mixed-integer programming (Q847850):
Displaying 11 items.
- 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)
- Stochastic hydro-thermal unit commitment via multi-level scenario trees and bundle regularization (Q779756) (← links)
- Reformulating the disjunctive cut generating linear program (Q827289) (← links)
- Two-term disjunctions on the second-order cone (Q896297) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- Mixed integer programming with a class of nonlinear convex constraints (Q1751218) (← links)
- ``Facet'' separation with one linear program (Q2330653) (← links)
- A note on the selection of Benders' cuts (Q2638375) (← links)
- Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems (Q2960369) (← links)
