SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
From MaRDI portal
Recommendations
- Mixed-integer nonlinear optimization
- Minotaur: a mixed-integer nonlinear optimization toolkit
- An algorithmic framework for convex mixed integer nonlinear programs
- FilMINT: an outer approximation-based solver for convex mixed-integer nonlinear programs
- On branching rules for convex mixed-integer nonlinear optimization
Cites work
- A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
- A branch-and-reduce approach to global optimization
- A constraint integer programming approach for resource-constrained project scheduling
- A global optimization algorithm for linear fractional and bilinear programs
- A polyhedral branch-and-cut approach to global optimization
- A review of recent advances in global optimization
- A Successive Underestimation Method for Concave Minimization Problems
- An Automatic Method of Solving Discrete Programming Problems
- An evolutionary algorithm for polishing mixed integer programming solutions
- Analyzing the computational impact of MIQCP solver components
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Branch and bound, integer, and non-integer programming
- Branching and bounds tighteningtechniques for non-convex MINLP
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Conflict analysis in mixed integer programming
- Constraint Integer Programming: A New Approach to Integrate CP and MIP
- Constraint propagation on quadratic constraints
- Convex envelopes of monomials of odd degree
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Convexity and concavity detection in computational graphs: tree walks for convexity assessment
- Cost-Bounded Binary Decision Diagrams for 0-1 Programming
- DINS, a MIP Improvement Heuristic
- Efficient Calculation of Bounds on Spectra of Hessian Matrices
- Experiments in mixed-integer linear programming
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Extending a CIP framework to solve MIQCPs
- Feasibility-based bounds tightening via fixed points
- Global optimization problems and domain reduction strategies
- Global optimization. Scientific and engineering case studies
- Global optimization. Theory, algorithms, and applications
- GLOMIQO: global mixed-integer quadratic optimizer
- Handbook of global optimization
- scientific article; zbMATH DE number 3644821 (Why is no real title available?)
- scientific article; zbMATH DE number 47153 (Why is no real title available?)
- 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 2068059 (Why is no real title available?)
- scientific article; zbMATH DE number 757674 (Why is no real title available?)
- scientific article; zbMATH DE number 7124428 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- scientific article; zbMATH DE number 3281219 (Why is no real title available?)
- Interval analysis on directed acyclic graphs for global optimization
- Interval propagation and search on directed acyclic graphs for numerical constraint solving
- Introduction to Interval Analysis
- Lago: a (heuristic) branch and cut algorithm for nonconvex minlps
- Learning and propagating Lagrangian variable bounds for mixed-integer nonlinear programming
- Local branching
- Measuring the impact of primal heuristics
- MINLPLib -- a collection of test models for mixed-integer nonlinear programming
- MIP: Theory and practice -- closing the gap
- Mixed integer nonlinear programming. Selected papers based on the presentations at the IMA workshop mixed-integer nonlinear optimization: Algorithmic advances and applications, Minneapolis, MN, USA, November 17--21, 2008
- Mixed-integer nonlinear optimization
- On handling indicator constraints in mixed integer programming
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Prediction of oligopeptide conformations via deterministic global optimization
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Python
- Relaxation and decomposition methods for mixed integer nonlinear programming.
- Remarks on Zeros and Ties in the Wilcoxon Signed Rank Procedures
- RENS. The optimal rounding
- SCIP: solving constraint integer programs
- Solving Real-World Linear Programs: A Decade and More of Progress
- Three enhancements for optimization-based bound tightening
- Undercover: a primal MINLP heuristic exploring a largest sub-MIP
Cited in
(84)- Extended ant colony optimization for non-convex mixed integer nonlinear programming
- A hybrid LP/NLP paradigm for global optimization relaxations
- Juniper: an open-source nonlinear branch-and-bound solver in Julia
- Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations
- On decomposability of multilinear sets
- A computational study of global optimization solvers on two trust region subproblems
- Guided dive for the spatial branch-and-bound
- Realizability and inscribability for simplicial polytopes via nonlinear optimization
- SCIP-Jack -- a solver for STP and variants with parallelization extensions
- Graphical models for optimal power flow
- An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver
- Linear models for stockpiling in open-pit mine production scheduling problems
- On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation
- A decomposition approach for optimal gas network extension with a finite set of demand scenarios
- Monotonic reformulation and bound tightening for global optimization of ideal multi-component distillation columns
- Analyzing the computational impact of MIQCP solver components
- Tighter McCormick relaxations through subgradient propagation
- Experimental validation of volume-based comparison for double-McCormick relaxations
- On tackling reverse convex constraints for non-overlapping of unequal circles
- Linearization of McCormick relaxations and hybridization with the auxiliary variable method
- Parallel global search algorithm with local tuning for solving mixed-integer global optimization problems
- Branch-and-price for a class of nonconvex mixed-integer nonlinear programs
- A choice-based optimization approach for contracting in supply chains
- \texttt{Tenscalc}: a toolbox to generate fast code to solve nonlinear constrained minimizations and compute Nash equilibria
- Optimization hierarchy for fair statistical decision problems
- Linearization and parallelization schemes for convex mixed-integer nonlinear optimization
- On generalized surrogate duality in mixed-integer nonlinear programming
- Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT
- The cost of not knowing enough: mixed-integer optimization with implicit Lipschitz nonlinearities
- Bi-objective design-for-control of water distribution networks with global bounds
- Pyomo.GDP: an ecosystem for logic based modeling and optimization development
- The supporting hyperplane optimization toolkit for convex MINLP
- SUSPECT: MINLP special structure detector for Pyomo
- Optimality-based domain reduction for inequality-constrained NLP and MINLP problems
- Nutmeg: a MIP and CP hybrid solver using branch-and-check
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- QPLIB: a library of quadratic programming instances
- A branch-and-cut algorithm for mixed-integer bilinear programming
- Large-scale problems with quasi-block matrices
- New SOCP relaxation and branching rule for bipartite bilinear programs
- Piecewise polyhedral formulations for a multilinear term
- Convex and concave envelopes of artificial neural network activation functions for deterministic global optimization
- Mixed integer nonlinear program for minimization of Akaike's information criterion
- \textsc{PySCIPOpt}: mathematical programming in Python with the SCIP optimization suite
- Extending a CIP framework to solve MIQCPs
- FilMINT: an outer approximation-based solver for convex mixed-integer nonlinear programs
- Optimization as an analysis tool for human complex problem solving
- A numerical study of MIDACO on 100 MINLP benchmarks
- Branching and bounds tighteningtechniques for non-convex MINLP
- Minimization of Akaike's information criterion in linear regression analysis via mixed integer nonlinear program
- On the Performance of NLP Solvers Within Global MINLP Solvers
- Algorithm 996
- Conflict Analysis for MINLP
- On generalized surrogate duality in mixed-integer nonlinear programming
- Team Orienteering with Time-Varying Profit
- Tractable relaxations of composite functions
- Using two-dimensional projections for stronger separation and propagation of bilinear terms
- FiberSCIP—A Shared Memory Parallelization of SCIP
- COMPARISON BETWEEN FIVE MINLP SOLVERS AND NEW RESULTS RELATED TO TRIGONOMETRIC FUNCTIONS
- On the implementation and strengthening of intersection cuts for QCQPs
- A low-cost alternating projection approach for a continuous formulation of convex and cardinality constrained optimization
- Exact reliability optimization for series‐parallel graphs using convex envelopes
- A Huff-like location model with quality adjustment and/or closing of existing facilities
- A comparison of alternative models for solving a non-linear single plant hydro unit commitment problem
- MIP relaxations in factorable programming
- Enabling research through the SCIP Optimization Suite 8.0
- An Automated Approach to Causal Inference in Discrete Settings
- A risk-averse stochastic program for integrated system design and preventive maintenance planning
- Quadratization and convexification in polynomial binary optimization
- MUSE-BB: a decomposition algorithm for nonconvex two-stage problems using strong multisection branching
- Out-of-sample estimation for a branch-and-bound algorithm with growing datasets
- The pseudo-Boolean polytope and polynomial-size extended formulations for binary polynomial optimization
- Spatial branching for a special class of convex MIQO problems
- On the use of restriction of the right-hand side in spatial branch-and-bound algorithms to ensure termination
- Global optimization of mixed-integer nonlinear programs with SCIP 8
- 50 years of mixed-integer nonlinear and disjunctive programming
- Automatic source code generation for deterministic global optimization with parallel architectures
- A system to evaluate gas network capacities: concepts and implementation
- Determining inscribability of polytopes via rank minimization based on slack matrices
- Unifying view on sparse convex relaxations in polynomial optimization
- SCIP: solving constraint integer programs
- P-split formulations: a class of intermediate formulations between big-M and convex hull for disjunctive constraints
- Minotaur: a mixed-integer nonlinear optimization toolkit
- An algorithmic framework for convex mixed integer nonlinear programs
Describes a project that uses
Uses Software
This page was built for publication: SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4637831)
