Pages that link to "Item:Q951092"
From MaRDI portal
The following pages link to An algorithmic framework for convex mixed integer nonlinear programs (Q951092):
Displaying 50 items.
- A mean-risk mixed integer nonlinear program for transportation network protection (Q1681354) (← links)
- Product allocation to different types of distribution center in retail logistics networks (Q1681420) (← links)
- Virtuous smoothing for global optimization (Q1683327) (← links)
- An exact algorithm for a resource allocation problem in mobile wireless communications (Q1687306) (← links)
- Convex quadratic relaxations for mixed-integer nonlinear programs in power systems (Q1688449) (← links)
- Extended formulations in mixed integer conic quadratic programming (Q1688453) (← links)
- Graphical models for optimal power flow (Q1701228) (← links)
- RBFOpt: an open-source library for black-box optimization with costly function evaluations (Q1741116) (← 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)
- On speed scaling via integer programming (Q1785426) (← links)
- Polyhedral approximation in mixed-integer convex optimization (Q1800994) (← links)
- Design of intermodal logistics networks with hub delays (Q1926780) (← links)
- A piecewise linearization framework for retail shelf space management models (Q1926922) (← links)
- Inexact solution of NLP subproblems in MINLP (Q1942026) (← links)
- Stochastic binary problems with simple penalties for capacity constraints violations (Q1949274) (← links)
- A note on solving DiDi's driver-order matching problem (Q1996745) (← links)
- Penalty and relaxation methods for the optimal placement and operation of control valves in water supply networks (Q2012240) (← links)
- Preprocessing and cutting planes with conflict graphs (Q2027062) (← links)
- An effective procedure for feature subset selection in logistic regression based on information criteria (Q2044566) (← links)
- Outer approximation for global optimization of mixed-integer quadratic bilevel problems (Q2044965) (← links)
- A method for convex black-box integer global optimization (Q2045020) (← links)
- Partially distributed outer approximation (Q2046262) (← links)
- Sparse classification: a scalable discrete optimization perspective (Q2071494) (← links)
- A choice-based optimization approach for contracting in supply chains (Q2083952) (← links)
- Alternative regularizations for outer-approximation algorithms for convex MINLP (Q2089881) (← links)
- Adaptive sampling line search for local stochastic optimization with integer variables (Q2097662) (← links)
- Linearization and parallelization schemes for convex mixed-integer nonlinear optimization (Q2114818) (← links)
- Submodularity and local search approaches for maximum capture problems under generalized extreme value models (Q2116913) (← links)
- Nonlinear chance-constrained problems with applications to hydro scheduling (Q2118083) (← links)
- Constructing lattice-free gradient polyhedra in dimension two (Q2118128) (← links)
- Pump scheduling in drinking water distribution networks with an LP/NLP-based branch and bound (Q2129196) (← links)
- A disjunctive cut strengthening technique for convex MINLP (Q2129197) (← links)
- Inversion of convection-diffusion equation with discrete sources (Q2129202) (← links)
- Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections (Q2131141) (← links)
- The cost of not knowing enough: mixed-integer optimization with implicit Lipschitz nonlinearities (Q2136869) (← links)
- The supporting hyperplane optimization toolkit for convex MINLP (Q2162510) (← links)
- On the implementation of a global optimization method for mixed-variable problems (Q2165595) (← links)
- A multicut outer-approximation approach for competitive facility location under random utilities (Q2178115) (← links)
- An overview of MINLP algorithms and their implementation in Muriqui optimizer (Q2178345) (← links)
- Outer approximation with conic certificates for mixed-integer convex problems (Q2195682) (← links)
- An augmented Lagrangian filter method (Q2216190) (← links)
- Relax-tighten-round algorithm for optimal placement and control of valves and chlorine boosters in water networks (Q2239916) (← links)
- Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation (Q2250087) (← links)
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations (Q2250093) (← links)
- A branch and bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation (Q2251137) (← links)
- On valid inequalities for mixed integer \(p\)-order cone programming (Q2251546) (← links)
- A mixed-integer nonlinear program for the optimal design and dispatch of distributed generation systems (Q2254189) (← links)
- A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables (Q2255939) (← links)
