Pages that link to "Item:Q3757690"

The following pages link to An outer-approximation algorithm for a class of mixed-integer nonlinear programs (Q3757690):

Displaying 50 items.

• A branch and bound algorithm for bi-level discrete network design problem (Q264253) (← links)
• Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems (Q280099) (← links)
• Solving disjunctive optimization problems by generalized semi-infinite optimization techniques (Q301738) (← links)
• Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects (Q312490) (← links)
• Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
• A 3D optimal control problem related to the urban heat islands (Q333894) (← links)
• A planar single facility location and border crossing problem (Q339663) (← links)
• A two-stage robust optimization approach for the mobile facility fleet sizing and routing problem under uncertainty (Q342259) (← links)
• GLOMIQO: global mixed-integer quadratic optimizer (Q367170) (← 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)
• An LPCC approach to nonconvex quadratic programs (Q431005) (← links)
• A hierarchy of relaxations for nonlinear convex generalized disjunctive programming (Q439452) (← links)
• Mixed-integer nonlinear programs featuring ``on/off'' constraints (Q453616) (← links)
• An improved Bernstein global optimization algorithm for MINLP problems with application in process industry (Q475423) (← links)
• Strong-branching inequalities for convex mixed integer nonlinear programs (Q480939) (← links)
• Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming (Q486413) (← 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)
• Retrofit of multiproduct batch plants through generalized disjunctive programming (Q597504) (← links)
• A new local and global optimization method for mixed integer quadratic programming problems (Q606807) (← links)
• A four-type decision-variable MINLP model for a supply chain network design (Q624701) (← links)
• Generalized Benders' decomposition for topology optimization problems (Q652657) (← links)
• A working set SQCQP algorithm with simple nonmonotone penalty parameters (Q654747) (← links)
• Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs (Q662860) (← links)
• An assembly-type supply chain system controlled by kanbans under a just-in-time delivery policy (Q707140) (← links)
• An algorithm for nonlinear optimization problems with binary variables (Q711384) (← 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)
• Combinatorial optimal control of semilinear elliptic PDEs (Q721947) (← links)
• Convex mixed integer nonlinear programming problems and an outer approximation algorithm (Q746812) (← links)
• Mixed integer nonlinear programming tools: a practical overview (Q766256) (← links)
• Sparse hierarchical regression with polynomials (Q782451) (← links)
• Logic-based modeling and solution of nonlinear discrete/continuous optimization problems (Q817192) (← links)
• Solving planning and design problems in the process industry using mixed integer and global optimization (Q817211) (← links)
• Optimal models for a multi-stage supply chain system controlled by kanban under just-in-time philosophy (Q818091) (← links)
• Minotaur: a mixed-integer nonlinear optimization toolkit (Q823885) (← links)
• A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes (Q833581) (← links)
• Outer approximation algorithm for one class of convex mixed-integer nonlinear programming problems with partial differentiability (Q896190) (← links)
• Rehabilitation and replacement of water distribution system components considering uncertainties (Q922148) (← 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)
• The oracle penalty method (Q975775) (← links)
• Mathematical programming approaches for generating \(p\)-efficient points (Q992653) (← links)