Global optimization of mixed-integer nonlinear programs with SCIP 8
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 976325 (Why is no real title available?)
- scientific article; zbMATH DE number 1101647 (Why is no real title available?)
- scientific article; zbMATH DE number 2068080 (Why is no real title available?)
- scientific article; zbMATH DE number 221928 (Why is no real title available?)
- scientific article; zbMATH DE number 7124428 (Why is no real title available?)
- scientific article; zbMATH DE number 3281219 (Why is no real title available?)
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- A computational study of perspective cuts
- A hybrid LP/NLP paradigm for global optimization relaxations
- A polyhedral branch-and-cut approach to global optimization
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- BARON: A general purpose global optimization software package
- Branch-and-cut for complementarity and cardinality constrained linear programs
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Computing feasible points for binary MINLPs with MPECs
- Constraint propagation on quadratic constraints
- Convex envelopes of bivariate functions through the solution of KKT systems
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
- Efficient separation of RLT cuts for implicit and explicit bilinear products
- Extended formulations in mixed integer conic quadratic programming
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
- Global optimization. Scientific and engineering case studies
- Improved constraint consensus methods for seeking feasibility in nonlinear programs
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
- Maximal quadratic-free sets
- Mixed-integer nonlinear optimization
- Monoidal strengthening and unique lifting in MIQCPs
- On the implementation and strengthening of intersection cuts for QCQPs
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Perspective cuts for a class of convex 0-1 mixed integer programs
- Polyhedral convexity cuts and negative edge extensions
- Polytopes associated with symmetry handling
- Reformulations in mathematical programming: automatic symmetry detection and exploitation
- Rigorous convex underestimators for general twice-differentiable problems
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- Symmetry in integer linear programming
- The ESA NLP solver WORHP
- The Supporting Hyperplane Method for Unimodal Programming
- The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming
- The global solver in the LINDO API
- Three enhancements for optimization-based bound tightening
- Undercover: a primal MINLP heuristic exploring a largest sub-MIP
- Using two-dimensional projections for stronger separation and propagation of bilinear terms
Cited in
(2)
This page was built for publication: Global optimization of mixed-integer nonlinear programs with SCIP 8
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7020169)
