Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Presolve reductions in mixed integer programming
T Achterberg, RE Bixby, Z Gu… - INFORMS Journal …, 2020 - pubsonline.informs.org
Mixed integer programming has become a very powerful tool for modeling and solving real-
world planning and scheduling problems, with the breadth of applications appearing to be …
world planning and scheduling problems, with the breadth of applications appearing to be …
The scip optimization suite 3.2
G Gamrath, T Fischer, T Gally, A Gleixner, G Hendel… - 2016 - opus4.kobv.de
The SCIP Optimization Suite is a software toolbox for generating and solving various classes
of mathematical optimization problems. Its major components are the modeling language …
of mathematical optimization problems. Its major components are the modeling language …
Domain reduction techniques for global NLP and MINLP optimization
Y Puranik, NV Sahinidis - Constraints, 2017 - Springer
Optimization solvers routinely utilize presolve techniques, including model simplification,
reformulation and domain reduction techniques. Domain reduction techniques are …
reformulation and domain reduction techniques. Domain reduction techniques are …
Cooperation of combinatorial solvers for en-route conflict resolution
One of the key challenges towards more automation in Air Traffic Control is the resolution of
en-route conflicts. In this article we present a generic framework for the conflict resolution …
en-route conflicts. In this article we present a generic framework for the conflict resolution …
Two-row and two-column mixed-integer presolve using hashing-based pairing methods
In state-of-the-art mixed-integer programming solvers, a large array of reduction techniques
are applied to simplify the problem and strengthen the model formulation before starting the …
are applied to simplify the problem and strengthen the model formulation before starting the …
[HTML][HTML] Presolving linear bilevel optimization problems
Linear bilevel optimization problems are known to be strongly NP-hard and the
computational techniques to solve these problems are often motivated by techniques from …
computational techniques to solve these problems are often motivated by techniques from …
Using Constraint Propagation to Bound Linear Programs
T Dlask, T Werner - Journal of Artificial Intelligence Research, 2024 - jair.org
We present an approach to compute bounds on the optimal value of linear programs based
on constraint propagation. Given a feasible dual solution, we apply constraint propagation to …
on constraint propagation. Given a feasible dual solution, we apply constraint propagation to …
Determining on-fault earthquake magnitude distributions from integer programming
Earthquake magnitude distributions among faults within a fault system are determined from
regional seismicity and fault slip rates using binary integer programming. A synthetic …
regional seismicity and fault slip rates using binary integer programming. A synthetic …
Serial and Parallel Two-Column Probing for Mixed-Integer Programming
Probing in mixed-integer programming (MIP) is a technique of temporarily fixing variables to
discover implications that are useful to branch-and-cut solvers. Such fixing is typically …
discover implications that are useful to branch-and-cut solvers. Such fixing is typically …
Solving mixed-integer programs arising in production planning
D Weninger - 2016 - publica.fraunhofer.de
In the light of increasing globalization and ongoing rapid developments in information
technology, software systems for planning production and supply networks play an important …
technology, software systems for planning production and supply networks play an important …