Pages that link to "Item:Q2897292"
From MaRDI portal
The following pages link to Algorithms and Software for Convex Mixed Integer Nonlinear Programs (Q2897292):
Displaying 50 items.
- Approximated perspective relaxations: a project and lift approach (Q263157) (← links)
- CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization (Q298162) (← links)
- Benders decomposition without separability: a computational study for capacitated facility location problems (Q323204) (← 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)
- Modeling max-min fair bandwidth allocation in BitTorrent communities (Q513724) (← links)
- Regularized optimization methods for convex MINLP problems (Q518454) (← links)
- Easy distributions for combinatorial optimization problems with probabilistic constraints (Q614036) (← links)
- Integrality gap minimization heuristics for binary mixed integer nonlinear programming (Q721171) (← links)
- An algorithmic framework for convex mixed integer nonlinear programs (Q951092) (← 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)
- On solving generalized convex MINLP problems using supporting hyperplane techniques (Q1668811) (← links)
- Extended formulations in mixed integer conic quadratic programming (Q1688453) (← links)
- Logistic regression: from art to science (Q1750250) (← links)
- On speed scaling via integer programming (Q1785426) (← links)
- Polyhedral approximation in mixed-integer convex optimization (Q1800994) (← links)
- Valid inequalities for separable concave constraints with indicator variables (Q1801013) (← links)
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications (Q1856388) (← links)
- A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization (Q1946925) (← 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)
- Outer approximation for integer nonlinear programs via decision diagrams (Q2020602) (← links)
- A fast exact method for the capacitated facility location problem with differentiable convex production costs (Q2030454) (← links)
- Partially distributed outer approximation (Q2046262) (← links)
- Branch-and-price for a class of nonconvex mixed-integer nonlinear programs (Q2052398) (← links)
- Vehicle dispatching plan for minimizing passenger waiting time in a corridor with buses of different sizes: model formulation and solution approaches (Q2077989) (← links)
- Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT (Q2124807) (← links)
- A disjunctive cut strengthening technique for convex MINLP (Q2129197) (← links)
- A numerical method for interval multi-objective mixed-integer optimal control problems based on quantum heuristic algorithm (Q2150758) (← 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)
- Least costly energy management for extended-range electric vehicles: an economic optimization framework (Q2220035) (← links)
- Valid inequalities for quadratic optimisation with domain constraints (Q2234747) (← links)
- Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation (Q2250087) (← links)
- On handling indicator constraints in mixed integer programming (Q2374361) (← links)
- Mathematical programming based heuristics for the 0--1 MIP: a survey (Q2401328) (← links)
- Unbounded convex sets for non-convex mixed-integer quadratic programming (Q2436643) (← links)
- A note on solving MINLP's using formulation space search (Q2448189) (← links)
- Strong relaxations for continuous nonlinear programs based on decision diagrams (Q2661626) (← links)
- Two linear approximation algorithms for convex mixed integer nonlinear programming (Q2675735) (← links)
- A software for the integer linear programming (Q2746895) (← links)
- Convexity and solutions of stochastic multidimensional 0-1 knapsack problems with probabilistic constraints (Q2806828) (← links)
- Cutting-planes for weakly-coupled \(0/1\) second order cone programs (Q2883643) (← links)
- FilMINT: an outer approximation-based solver for convex mixed-integer nonlinear programs (Q2899087) (← links)
- An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs (Q2967613) (← links)
- Extended Formulations in Mixed-Integer Convex Programming (Q3186495) (← links)
- Cutting Plane Algorithm for Convex Generalized Disjunctive Programs (Q3186647) (← links)
- Supporting Global Numerical Optimization of Rational Functions by Generic Symbolic Convexity Tests (Q3589077) (← links)
- (Q4285799) (← links)
