Pages that link to "Item:Q5419635"

The following pages link to Mixed-integer nonlinear optimization (Q5419635):

Displaying 50 items.

• OSQP: An Operator Splitting Solver for Quadratic Programs (Q78613) (← links)
• Towards an objective feasibility pump for convex minlps (Q263161) (← links)
• Optimistic MILP modeling of non-linear optimization problems (Q297051) (← 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)
• Strong-branching inequalities for convex mixed integer nonlinear programs (Q480939) (← links)
• Empirical decision model learning (Q511793) (← links)
• Exact methods for solving the elementary shortest and longest path problems (Q512936) (← links)
• Relaxations and discretizations for the pooling problem (Q513173) (← links)
• Regularized optimization methods for convex MINLP problems (Q518454) (← links)
• Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization (Q522270) (← links)
• Computing equilibria of Cournot oligopoly models with mixed-integer quantities (Q684137) (← links)
• Combinatorial optimal control of semilinear elliptic PDEs (Q721947) (← links)
• Experiments on virtual private network design with concave capacity costs (Q723484) (← links)
• Minotaur: a mixed-integer nonlinear optimization toolkit (Q823885) (← links)
• Non-monotone derivative-free algorithm for solving optimization models with linear constraints: extensions for solving nonlinearly constrained models via exact penalty methods (Q828735) (← links)
• Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches (Q1616947) (← links)
• Dual mean field search for large scale linear and quadratic knapsack problems (Q1620646) (← links)
• A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach (Q1628068) (← links)
• Computational approaches for mixed integer optimal control problems with indicator constraints (Q1633792) (← links)
• Service system design for managing interruption risks: a backup-service risk-mitigation strategy (Q1634282) (← links)
• Optimization methods for petroleum fields development and production systems: a review (Q1642989) (← links)
• Petroleum refinery optimization (Q1642991) (← links)
• A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables (Q1675255) (← links)
• An exact algorithm for a resource allocation problem in mobile wireless communications (Q1687306) (← links)
• Algorithms for generalized potential games with mixed-integer variables (Q1694402) (← links)
• Decomposition-based inner- and outer-refinement algorithms for global optimization (Q1756777) (← links)
• Monotonic reformulation and bound tightening for global optimization of ideal multi-component distillation columns (Q1787334) (← links)
• Polyhedral approximation in mixed-integer convex optimization (Q1800994) (← links)
• Valid inequalities for separable concave constraints with indicator variables (Q1801013) (← links)
• Penalty and relaxation methods for the optimal placement and operation of control valves in water supply networks (Q2012240) (← links)
• Outer approximation for integer nonlinear programs via decision diagrams (Q2020602) (← links)
• Outer approximation for global optimization of mixed-integer quadratic bilevel problems (Q2044965) (← links)
• Solving mixed-integer nonlinear optimization problems using simultaneous convexification: a case study for gas networks (Q2045011) (← links)
• Sparse regression at scale: branch-and-bound rooted in first-order optimization (Q2097642) (← links)
• A framework for generalized Benders' decomposition and its application to multilevel optimization (Q2097644) (← links)
• Non-convex nested Benders decomposition (Q2097672) (← links)
• An improved penalty algorithm using model order reduction for MIPDECO problems with partial observations (Q2111473) (← links)
• Linearization and parallelization schemes for convex mixed-integer nonlinear optimization (Q2114818) (← links)
• Pump scheduling in drinking water distribution networks with an LP/NLP-based branch and bound (Q2129196) (← links)
• Inversion of convection-diffusion equation with discrete sources (Q2129202) (← links)
• The cost of not knowing enough: mixed-integer optimization with implicit Lipschitz nonlinearities (Q2136869) (← links)
• Bi-objective design-for-control of water distribution networks with global bounds (Q2138314) (← links)
• Improved penalty algorithm for mixed integer PDE constrained optimization problems (Q2147266) (← links)
• Mixed-integer minimax dynamic optimization for structure identification of glycerol metabolic network (Q2174711) (← links)
• SUSPECT: MINLP special structure detector for Pyomo (Q2182769) (← links)
• Outer approximation with conic certificates for mixed-integer convex problems (Q2195682) (← links)
• Outer-product-free sets for polynomial optimization and oracle-based cuts (Q2196293) (← links)
• Generating valid linear inequalities for nonlinear programs via sums of squares (Q2198537) (← links)
• An augmented Lagrangian filter method (Q2216190) (← links)