The SCIP Optimization Suite 3.2
By Gerald Gamrath, Tobias Fischer, Tristan Gally, Ambros M. Gleixner, Gregor Hendel, Thorsten Koch, Stephen J. Maher, Matthias Miltenberger, Benjamin Müller, Marc E. Pfetsch and 11 more. 2016
100 citations recorded by the source corpus.
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
- Elias Boutros Khalil
- Marc E. Pfetsch
- Bistra N. Dilkina
- Shabbir Ahmed
- Gerald Gamrath
- K. Bestuzheva
- George L. Nemhauser
- Nico Pietroni
Citations in the corpus
- Learning to Run Heuristics in Tree Search (2017, methodology): “To evaluate the proposed framework, we modify the opensource MIP solver SCIP 3.2.1 [Gamrath et al., 2016]; CPLEX 12.6.1 [IBM, 2014] is used as SCIP’s LP solver.”
- Position-based tensegrity design (2017, methodology): “17, the overall process took 82 minutes; tests were performed on a 2.3 GHz Intel Core i7 with 8Gb and we used SCIP [Gamrath et al. 2016] for the ILP problem.”
- The SCIP Optimization Suite 7.0 (2020, methodology): “…when the labeling process is concluded, the following quantities are computed and displayed: − number of blocks; − number of linking variables and linking constraints; − size of the largest and smallest block regarding the number of constraints; − Area score: The area score (see also [36], Sec.”