Pages that link to "Item:Q2897296"
From MaRDI portal
The following pages link to Disjunctive Cuts for Nonconvex MINLP (Q2897296):
Displaying 17 items.
- Strong-branching inequalities for convex mixed integer nonlinear programs (Q480939) (← links)
- How to convexify the intersection of a second order cone and a nonconvex quadratic (Q517311) (← links)
- Global optimization of generalized semi-infinite programs using disjunctive programming (Q670652) (← links)
- Computing deep facet-defining disjunctive cuts for mixed-integer programming (Q847850) (← links)
- Two-term disjunctions on the second-order cone (Q896297) (← links)
- Column enumeration based decomposition techniques for a class of non-convex MINLP problems (Q1029695) (← links)
- Review of nonlinear mixed-integer and disjunctive programming techniques (Q1863893) (← links)
- A general branch-and-bound framework for continuous global multiobjective optimization (Q2038927) (← links)
- A disjunctive cut strengthening technique for convex MINLP (Q2129197) (← links)
- On decomposition and multiobjective-based column and disjunctive cut generation for MINLP (Q2129200) (← links)
- The value of cooperation in interregional transmission planning: a noncooperative equilibrium model approach (Q2183886) (← links)
- On the facet defining inequalities of the mixed-integer bilinear covering set (Q2216198) (← links)
- Disjunctive cuts for continuous linear bilevel programming (Q2463829) (← links)
- A convex-analysis perspective on disjunctive cuts (Q2492679) (← links)
- Exact and approximation algorithms for a soft rectangle packing problem (Q2926482) (← links)
- Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs (Q3503837) (← links)
- A solver for multiobjective mixed-integer convex and nonconvex optimization (Q6644257) (← links)
