Mixed integer nonlinear programming tools: an updated practical overview
From MaRDI portal
Publication:2393446
DOI10.1007/s10479-012-1272-5zbMath1269.90067OpenAlexW2054137436MaRDI QIDQ2393446
Claudia D'Ambrosio, Andrea Lodi
Publication date: 8 August 2013
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-012-1272-5
Related Items
Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT, Pump scheduling in drinking water distribution networks with an LP/NLP-based branch and bound, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, Measures of balance in combinatorial optimization, Using \(\ell^p\)-norms for fairness in combinatorial optimisation, Rejoinder on: ``On learning and branching: a survey, The value of cooperation in interregional transmission planning: a noncooperative equilibrium model approach, An exact algorithm for a resource allocation problem in mobile wireless communications, Complex portfolio selection via convex mixed‐integer quadratic programming: a survey, Derivative-free mixed binary necklace optimization for cyclic-symmetry optimal design problems, Valid inequalities for quadratic optimisation with domain constraints, Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization, ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
Uses Software
Cites Work
- Unnamed Item
- A Modeling Language for Mathematical Programming
- Application-oriented mixed integer non-linear programming
- Mixed integer nonlinear programming tools: a practical overview
- Lago: a (heuristic) branch and cut algorithm for nonconvex minlps
- An algorithmic framework for convex mixed integer nonlinear programs
- A feasibility pump for mixed integer nonlinear programs
- Partitioning procedures for solving mixed-variables programming problems
- Different transformations for solving non-convex trim-loss problems by MINLP
- MINTO, a Mixed INTeger Optimizer
- Rounding-based heuristics for nonconvex MINLPS
- Reformulation and convex relaxation techniques for global optimization
- Review of nonlinear mixed-integer and disjunctive programming techniques
- Solving pseudo-convex mixed integer optimization problems by cutting plane techniques
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- A branch-and-reduce approach to global optimization
- BARON: A general purpose global optimization software package
- Relaxation and decomposition methods for mixed integer nonlinear programming.
- Conflict analysis in mixed integer programming
- Generalized Benders decomposition
- Extending a CIP Framework to Solve MIQCPs
- FilMINT: An Outer Approximation-Based Solver for Convex Mixed-Integer Nonlinear Programs
- The Cutting-Plane Method for Solving Convex Programs
- An Automatic Method of Solving Discrete Programming Problems
- Branching and bounds tighteningtechniques for non-convex MINLP
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Optimization Case Studies in the NEOS Guide
- CUTE
- Pseudo-Convex Functions
- A tree-search algorithm for mixed integer programming problems
- There Cannot be any Algorithm for Integer Programming with Quadratic Constraints
- Integrating SQP and branch-and-bound for mixed integer nonlinear programming
