Progress in presolving for mixed integer programming

By Gerald Gamrath, Thorsten Koch, Alexander Martin, Matthias Miltenberger, Dieter Weninger. 2015

60 citations recorded by the source corpus.

Subfields: Control and Systems Engineering, Industrial and Manufacturing Engineering, Numerical Analysis

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Control and Systems Engineering

1. Haroldo Gambini Santos
2. Greet Vanden Berghe
3. Matheus Guedes Vilas Boas
4. Stefan Vigerske
5. L. Merschmann
6. Ruth Misener
7. Christodoulos A. Floudas

In Industrial and Manufacturing Engineering

1. Haroldo Gambini Santos
2. Greet Vanden Berghe
3. Matheus Guedes Vilas Boas
4. Marc E. Pfetsch
5. L. Merschmann
6. François Margot

In Numerical Analysis

1. Haroldo Gambini Santos
2. Stefan Vigerske
3. Ruth Misener
4. Christodoulos A. Floudas

Citations in the corpus

• Optimal Decision Trees for the Algorithm Selection Problem: Integer Programming Based Approaches (2019, background): “Despite the continuous evolution of MIP solvers (Johnson et al., 2000; Gamrath et al., 2015), the optimization of large MIP models in restricted times, in the general case, is still challenging.”
• The SCIP Optimization Suite 7.0 (2020, methodology): “This case has already been integrated into SCIP as a successful presolving technique [31] within the default plugin cons components.”
• The SCIP Optimization Suite 3.2 (2016, background): “…on their runtime complexity and improve their coordination ◦ Primal Heuristics (Section 2.3): – the development of new primal heuristics: distribution diving, indicator and bound heuristics – improved clique and variable bound heuristics – revision of the diving heuristics implementation:…”
• Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning (2016, unknown): “Constraint propagation, also known as node presolving in the mixed integer programming community [129], exploits the repeated application of logical inference rules in an attempt to derive contradictions that allow a subproblem to be pruned.”