[PDF][PDF] The SCIP optimization suite 4.0
SJ Maher, T Fischer, T Gally, G Gamrath, A Gleixner… - 2017 - opus4.kobv.de
The SCIP Optimization Suite is a powerful collection of optimization software that consists of
the branch-cut-and-price framework and mixed-integer programming solver SCIP, the linear …
the branch-cut-and-price framework and mixed-integer programming solver SCIP, the linear …
[КНИГА][B] Heuristic algorithms in global MINLP solvers
T Berthold - 2015 - zib.de
In the literature for mixed integer programming, heuristic algorithms (particularly primal
heuristics) are often considered as stand-alone procedures; in that context, heuristics are …
heuristics) are often considered as stand-alone procedures; in that context, heuristics are …
A dynamic reformulation heuristic for generalized interdiction problems
We consider a subfamily of mixed-integer linear bilevel problems that we call Generalized
Interdiction Problems. This class of problems includes, among others, the widely-studied …
Interdiction Problems. This class of problems includes, among others, the widely-studied …
A unified framework for multistage mixed integer linear optimization
We introduce a unified framework for the study of multilevel mixed integer linear optimization
problems and multistage stochastic mixed integer linear optimization problems with …
problems and multistage stochastic mixed integer linear optimization problems with …
Improving strong branching by domain propagation
G Gamrath - EURO Journal on Computational Optimization, 2014 - Elsevier
One of the essential components of a branch-and-bound based mixed-integer linear
programming (MIP) solver is the branching rule. Strong branching is a method used by many …
programming (MIP) solver is the branching rule. Strong branching is a method used by many …
A wide branching strategy for the graph coloring problem
DR Morrison, JJ Sauppe, EC Sewell… - INFORMS Journal …, 2014 - pubsonline.informs.org
Branch-and-price algorithms for the graph coloring problem use an exponentially sized
independent set-based integer programming formulation to produce usually tight lower …
independent set-based integer programming formulation to produce usually tight lower …
[КНИГА][B] New methods for branch-and-bound algorithms
DR Morrison - 2014 - search.proquest.com
Abstract Branch-and-bound (B&B) algorithms, and extensions such as branch-and-price
(B&P) are powerful tools for optimization. These algorithms are used in a wide variety of …
(B&P) are powerful tools for optimization. These algorithms are used in a wide variety of …
Improving strong branching by propagation
G Gamrath - Integration of AI and OR Techniques in Constraint …, 2013 - Springer
Strong branching is an important component of most variable selection rules in branch-and-
bound based mixed-integer linear programming solvers. It predicts the dual bounds of …
bound based mixed-integer linear programming solvers. It predicts the dual bounds of …
On Bilevel programming and its impact in branching, cutting and complexity
A Lodi - Integration of AI and OR Techniques in Constraint …, 2011 - Springer
Bilevel programming is a rich paradigm to express a variety of real-world applications
including game theoretic and pricing ones. However, what we are interested in this talk is to …
including game theoretic and pricing ones. However, what we are interested in this talk is to …
Propagation in Constraints: How One Thing Leads to Another.
IP Gent - CPAIOR, 2011 - books.google.com
Bilevel programming is a rich paradigm to express a variety of real-world applications
including game theoretic and pricing ones. However, what we are interested in this talk is to …
including game theoretic and pricing ones. However, what we are interested in this talk is to …