The following pages link to Bonmin (Q16933):
Displaying 50 items.
- An algorithm for two-stage stochastic mixed-integer nonlinear convex problems (Q256673) (← links)
- Towards an objective feasibility pump for convex minlps (Q263161) (← links)
- Communication protocols for options and results in a distributed optimization environment (Q298160) (← links)
- Global optimization with spline constraints: a new branch-and-bound method based on B-splines (Q300751) (← links)
- A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in \(n\)-space (Q316167) (← links)
- Mathematical programming techniques in water network optimization (Q319201) (← 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)
- GLOMIQO: global mixed-integer quadratic optimizer (Q367170) (← links)
- Modeling without categorical variables: a mixed-integer nonlinear program for the optimization of thermal insulation systems (Q374673) (← links)
- Semidefinite relaxations for non-convex quadratic mixed-integer programming (Q378112) (← links)
- A recipe for finding good solutions to MINLPs (Q384810) (← links)
- A framework for globally optimizing mixed-integer signomial programs (Q398656) (← links)
- On the optimal design of water distribution networks: a practical MINLP approach (Q400003) (← links)
- Using the analytic center in the feasibility pump (Q408384) (← 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)
- The integer approximation error in mixed-integer optimal control (Q431013) (← links)
- A hierarchy of relaxations for nonlinear convex generalized disjunctive programming (Q439452) (← links)
- Fitting piecewise linear continuous functions (Q439615) (← links)
- Mixed-integer nonlinear programs featuring ``on/off'' constraints (Q453616) (← links)
- Energy-optimal multi-goal motion planning for planar robot manipulators (Q467470) (← links)
- An improved Bernstein global optimization algorithm for MINLP problems with application in process industry (Q475423) (← links)
- Column generation bounds for numerical microaggregation (Q486386) (← links)
- Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming (Q486413) (← links)
- SO-MI: a surrogate model algorithm for computationally expensive nonlinear mixed-integer black-box global optimization problems (Q502458) (← links)
- Regularized optimization methods for convex MINLP problems (Q518454) (← links)
- Compressor scheduling in oil fields. Piecewise-linear formulation, valid inequalities, and computational analysis (Q535673) (← links)
- Optimal transition maneuvers for a class of V/STOL aircraft (Q540157) (← links)
- Point-to-point shortest paths on dynamic time-dependent road networks (Q607878) (← links)
- Combinatorial integral approximation (Q634784) (← links)
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations (Q652290) (← links)
- An improved column generation algorithm for minimum sum-of-squares clustering (Q662300) (← links)
- Extending the QCR method to general mixed-integer programs (Q662304) (← links)
- A risk-averse stochastic program for integrated system design and preventive maintenance planning (Q666964) (← links)
- Network expansion to mitigate market power (Q681461) (← links)
- A computational study of primal heuristics inside an MI(NL)P solver (Q683729) (← links)
- An effective branch-and-bound algorithm for convex quadratic integer programming (Q715081) (← 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)
- Combinatorial optimal control of semilinear elliptic PDEs (Q721947) (← links)
- TACO: a toolkit for AMPL control optimization (Q744209) (← links)
- RENS. The optimal rounding (Q744216) (← links)
- Convex mixed integer nonlinear programming problems and an outer approximation algorithm (Q746812) (← links)
- Mixed integer nonlinear programming tools: a practical overview (Q766256) (← links)
- An order-based algorithm for minimum dominating set with application in graph mining (Q781288) (← links)
- Conic mixed-integer rounding cuts (Q847842) (← links)
- Outer approximation algorithm for one class of convex mixed-integer nonlinear programming problems with partial differentiability (Q896190) (← links)
- An algorithmic framework for convex mixed integer nonlinear programs (Q951092) (← links)
- A feasibility pump for mixed integer nonlinear programs (Q1013979) (← links)
