Linearization and parallelization schemes for convex mixed-integer nonlinear optimization
From MaRDI portal
Publication:2114818
Recommendations
- Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation
- FilMINT: an outer approximation-based solver for convex mixed-integer nonlinear programs
- On branching rules for convex mixed-integer nonlinear optimization
- Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
Cites work
- scientific article; zbMATH DE number 1266748 (Why is no real title available?)
- A Computational Study of Search Strategies for Mixed Integer Programming
- A computational study of primal heuristics inside an MI(NL)P solver
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs
- An algorithmic framework for convex mixed integer nonlinear programs
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- An overview of MINLP algorithms and their implementation in Muriqui optimizer
- BARON: A general purpose global optimization software package
- Benchmarking optimization software with performance profiles.
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- Branching rules revisited
- Computational experience with a software framework for parallel integer programming
- Conflict analysis in mixed integer programming
- Experiments with conflict analysis in mixed integer programming
- Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
- Exploring relaxation induced neighborhoods to improve MIP solutions
- FiberSCIP—A Shared Memory Parallelization of SCIP
- FilMINT: an outer approximation-based solver for convex mixed-integer nonlinear programs
- Generalized Benders decomposition
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Heuristics for convex mixed integer nonlinear programs
- MINLPLib -- a collection of test models for mixed-integer nonlinear programming
- Minotaur: a mixed-integer nonlinear optimization toolkit
- Mixed-integer nonlinear optimization
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- On the solution of traveling salesman problems
- PEBBL: an object-oriented framework for scalable parallel branch and bound
- ParaXpress: an experimental extension of the FICO Xpress-Optimizer to solve hard MIPs on supercomputers
- Parallel PIPS-SBB: multi-level parallelism for stochastic mixed-integer programs
- Parallelization of the FICO Xpress-Optimizer
- Presolve Reductions in Mixed Integer Programming
- Progress in computational mixed integer programming -- a look back from the other side of the tipping point
- Reformulations for utilizing separability when solving convex MINLP problems
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- SCIP: solving constraint integer programs
- Solving mixed integer nonlinear programs by outer approximation
- The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming
- The global solver in the LINDO API
- The ubiquity generator framework: 7 years of progress in parallelizing branch-and-bound
Cited in
(2)
Describes a project that uses
Uses Software
This page was built for publication: Linearization and parallelization schemes for convex mixed-integer nonlinear optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2114818)
