Pages that link to "Item:Q1337138"
From MaRDI portal
The following pages link to Solving mixed integer nonlinear programs by outer approximation (Q1337138):
Displaying 50 items.
- A branch and bound algorithm for bi-level discrete network design problem (Q264253) (← links)
- Solving disjunctive optimization problems by generalized semi-infinite optimization techniques (Q301738) (← links)
- A two-stage robust optimization approach for the mobile facility fleet sizing and routing problem under uncertainty (Q342259) (← links)
- A recipe for finding good solutions to MINLPs (Q384810) (← links)
- A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion (Q408393) (← links)
- Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach (Q411431) (← links)
- Heuristics for convex mixed integer nonlinear programs (Q429468) (← links)
- A hierarchy of relaxations for nonlinear convex generalized disjunctive programming (Q439452) (← links)
- An improved Bernstein global optimization algorithm for MINLP problems with application in process industry (Q475423) (← links)
- Numerical algorithm for a class of constrained optimal control problems of switched systems (Q478192) (← links)
- Truss topology optimization with discrete design variables by outer approximation (Q486729) (← links)
- Optimization methods for mixed integer weakly concave programming problems (Q489113) (← links)
- Regularized optimization methods for convex MINLP problems (Q518454) (← links)
- A dynamic convexized method for nonconvex mixed integer nonlinear programming (Q547132) (← links)
- A new local and global optimization method for mixed integer quadratic programming problems (Q606807) (← links)
- Generalized Benders' decomposition for topology optimization problems (Q652657) (← links)
- Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs (Q662860) (← links)
- Minimizing Lipschitz-continuous strongly convex functions over integer points in polytopes (Q715233) (← links)
- Reformulations for utilizing separability when solving convex MINLP problems (Q721170) (← links)
- Integrality gap minimization heuristics for binary mixed integer nonlinear programming (Q721171) (← links)
- Convex mixed integer nonlinear programming problems and an outer approximation algorithm (Q746812) (← links)
- Sparse hierarchical regression with polynomials (Q782451) (← links)
- Logic-based modeling and solution of nonlinear discrete/continuous optimization problems (Q817192) (← links)
- Minotaur: a mixed-integer nonlinear optimization toolkit (Q823885) (← links)
- A global optimization problem in portfolio selection (Q839845) (← links)
- Outer approximation algorithm for one class of convex mixed-integer nonlinear programming problems with partial differentiability (Q896190) (← links)
- A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures (Q933795) (← links)
- Lago: a (heuristic) branch and cut algorithm for nonconvex minlps (Q940828) (← links)
- An algorithmic framework for convex mixed integer nonlinear programs (Q951092) (← links)
- Mathematical programming approaches for generating \(p\)-efficient points (Q992653) (← links)
- Global optimization of signomial mixed-integer nonlinear programming problems with free variables (Q1024826) (← links)
- Constrained optimization with integer and continuous variables using inexact restoration and projected gradients (Q1653960) (← links)
- On solving generalized convex MINLP problems using supporting hyperplane techniques (Q1668811) (← links)
- Global optimization of disjunctive programs (Q1679482) (← links)
- A mean-risk mixed integer nonlinear program for transportation network protection (Q1681354) (← links)
- An exact algorithm for a resource allocation problem in mobile wireless communications (Q1687306) (← links)
- Extended formulations in mixed integer conic quadratic programming (Q1688453) (← links)
- A trajectory-based method for mixed integer nonlinear programming problems (Q1704918) (← links)
- Capacitated disassembly scheduling under stochastic yield and demand (Q1744511) (← links)
- Mixed integer programming with a class of nonlinear convex constraints (Q1751218) (← links)
- Outer approximation and submodular cuts for maximum capture facility location problems with random utilities (Q1754055) (← links)
- Decomposition-based inner- and outer-refinement algorithms for global optimization (Q1756777) (← links)
- Mixed integer programming for a special logic constrained optimal control problem (Q1780957) (← links)
- On speed scaling via integer programming (Q1785426) (← links)
- A storm of feasibility pumps for nonconvex MINLP (Q1925794) (← links)
- Decomposition strategy for the stochastic pooling problem (Q1928271) (← links)
- Inexact solution of NLP subproblems in MINLP (Q1942026) (← links)
- A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization (Q1946925) (← links)
- An outer-approximation approach for information-maximizing sensor selection (Q1947624) (← links)
- A review of deterministic optimization methods in engineering and management (Q1955154) (← links)
