Pages that link to "Item:Q2897292"
From MaRDI portal
The following pages link to Algorithms and Software for Convex Mixed Integer Nonlinear Programs (Q2897292):
Displayed 33 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)
- Easy distributions for combinatorial optimization problems with probabilistic constraints (Q614036) (← links)
- Integrality gap minimization heuristics for binary mixed integer nonlinear programming (Q721171) (← 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)
- 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)
- 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)
- 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)
- 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)
- Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON (Q4637830) (← links)
- Global solution of non-convex quadratically constrained quadratic programs (Q4646675) (← links)
- Penalty Alternating Direction Methods for Mixed-Integer Optimization: A New View on Feasibility Pumps (Q5348468) (← links)
- The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming (Q5964241) (← links)