Pages that link to "Item:Q5964241"
From MaRDI portal
The following pages link to The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming (Q5964241):
Displayed 29 items.
- SHOT (Q27518) (← links)
- Reformulations for utilizing separability when solving convex MINLP problems (Q721170) (← links)
- Reformulating the disjunctive cut generating linear program (Q827289) (← links)
- On solving generalized convex MINLP problems using supporting hyperplane techniques (Q1668811) (← links)
- Method for solving generalized convex nonsmooth mixed-integer nonlinear programming problems (Q1679493) (← links)
- Outer approximation for integer nonlinear programs via decision diagrams (Q2020602) (← links)
- A proximal-point outer approximation algorithm (Q2023688) (← links)
- Preprocessing and cutting planes with conflict graphs (Q2027062) (← links)
- Branch-and-price for a class of nonconvex mixed-integer nonlinear programs (Q2052398) (← links)
- A choice-based optimization approach for contracting in supply chains (Q2083952) (← links)
- Alternative regularizations for outer-approximation algorithms for convex MINLP (Q2089881) (← links)
- Linearization and parallelization schemes for convex mixed-integer nonlinear optimization (Q2114818) (← links)
- Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT (Q2124807) (← 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 supporting hyperplane optimization toolkit for convex MINLP (Q2162510) (← links)
- The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming (Q2173514) (← links)
- An overview of MINLP algorithms and their implementation in Muriqui optimizer (Q2178345) (← links)
- On the relation between the extended supporting hyperplane algorithm and Kelley's cutting plane algorithm (Q2200088) (← links)
- Using regularization and second order information in outer approximation for convex MINLP (Q2297649) (← links)
- On the approximation of unbounded convex sets by polyhedra (Q2671446) (← links)
- Two linear approximation algorithms for convex mixed integer nonlinear programming (Q2675735) (← links)
- Multi-Tree Decomposition Methods for Large-Scale Mixed Integer Nonlinear Optimization (Q3296380) (← links)
- Conflict Analysis for MINLP (Q4995080) (← links)
- Using projected cutting planes in the extended cutting plane method (Q5057972) (← links)
- Generating Feasible Points for Mixed-Integer Convex Optimization Problems by Inner Parallel Cuts (Q5158763) (← links)
- Fill‐rate service level constrained distribution network design (Q6060687) (← links)
- Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs (Q6166099) (← links)
- Distributed primal outer approximation algorithm for sparse convex programming with separable structures (Q6173959) (← links)