The following pages link to (Q3109952):
Displaying 16 items.
- Intersection cuts from multiple rows: a disjunctive programming approach (Q458123) (← links)
- Computing deep facet-defining disjunctive cuts for mixed-integer programming (Q847850) (← links)
- Outer approximation for integer nonlinear programs via decision diagrams (Q2020602) (← links)
- Maximal quadratic-free sets (Q2118125) (← 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)
- Finite Disjunctive Programming Characterizations for General Mixed-Integer Linear Programs (Q3013929) (← links)
- Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs (Q3503837) (← links)
- Maximal Quadratic-Free Sets (Q5041754) (← links)
- Cutting Plane Generation through Sparse Principal Component Analysis (Q5081781) (← links)
- Integer Programming and Combinatorial Optimization (Q5712451) (← links)
- Classical cuts for mixed-integer programming and branch-and-cut (Q5896802) (← links)
- On the implementation and strengthening of intersection cuts for QCQPs (Q5918425) (← links)
- On the implementation and strengthening of intersection cuts for QCQPs (Q5925638) (← links)
- An outer-approximation algorithm for maximum-entropy sampling (Q6202951) (← links)