Linearization and parallelization schemes for convex mixed-integer nonlinear optimization
From MaRDI portal
Publication:2114818
DOI10.1007/s10589-021-00335-xzbMath1487.90491OpenAlexW4205553009MaRDI QIDQ2114818
Publication date: 15 March 2022
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-021-00335-x
Convex programming (90C25) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Heuristics for convex mixed integer nonlinear programs
- Progress in computational mixed integer programming -- a look back from the other side of the tipping point
- A computational study of primal heuristics inside an MI(NL)P solver
- Reformulations for utilizing separability when solving convex MINLP problems
- SCIP: solving constraint integer programs
- Minotaur: a mixed-integer nonlinear optimization toolkit
- PEBBL: an object-oriented framework for scalable parallel branch and bound
- An algorithmic framework for convex mixed integer nonlinear programs
- On the solution of traveling salesman problems
- Solving mixed integer nonlinear programs by outer approximation
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Branching rules revisited
- BARON: A general purpose global optimization software package
- Experiments with conflict analysis in mixed integer programming
- An overview of MINLP algorithms and their implementation in Muriqui optimizer
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Parallel PIPS-SBB: multi-level parallelism for stochastic mixed-integer programs
- Conflict analysis in mixed integer programming
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Generalized Benders decomposition
- MINLPLib—A Collection of Test Models for Mixed-Integer Nonlinear Programming
- FilMINT: An Outer Approximation-Based Solver for Convex Mixed-Integer Nonlinear Programs
- Computational Experience with a Software Framework for Parallel Integer Programming
- An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs
- Presolve Reductions in Mixed Integer Programming
- The global solver in the LINDO API
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- A Computational Study of Search Strategies for Mixed Integer Programming
- Parallelization of the FICO Xpress-Optimizer
- ParaXpress: an experimental extension of the FICO Xpress-Optimizer to solve hard MIPs on supercomputers
- Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- The Ubiquity Generator Framework: 7 Years of Progress in Parallelizing Branch-and-Bound
- FiberSCIP—A Shared Memory Parallelization of SCIP
- Mixed-integer nonlinear optimization
- Benchmarking optimization software with performance profiles.
- The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming
This page was built for publication: Linearization and parallelization schemes for convex mixed-integer nonlinear optimization