Disjunctive cuts for mixed integer nonlinear programming problems
From MaRDI portal
Recommendations
Cited in
(20)- Outer approximation for integer nonlinear programs via decision diagrams
- Maximal quadratic-free sets
- Handling separable non-convexities using disjunctive cuts
- Disjunctive cuts for continuous linear bilevel programming
- A convex-analysis perspective on disjunctive cuts
- Disjunctive Cuts for Nonconvex MINLP
- Finite Disjunctive Programming Characterizations for General Mixed-Integer Linear Programs
- Cutting plane algorithm for convex generalized disjunctive programs
- Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs
- Intersection cuts from multiple rows: a disjunctive programming approach
- Disjunctive programming
- Maximal quadratic-free sets
- Cutting plane generation through sparse principal component analysis
- Integer Programming and Combinatorial Optimization
- Classical cuts for mixed-integer programming and branch-and-cut
- On the implementation and strengthening of intersection cuts for QCQPs
- On the implementation and strengthening of intersection cuts for QCQPs
- An outer-approximation algorithm for maximum-entropy sampling
- An outer-approximation algorithm for maximum-entropy sampling
- Computing deep facet-defining disjunctive cuts for mixed-integer programming
This page was built for publication: Disjunctive cuts for mixed integer nonlinear programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3109952)
