90C27 Combinatorial optimization
Refine
Year of publication
- 2014 (1)
Document Type
- ZIB-Report (1)
Language
- English (1)
Has Fulltext
- yes (1)
Is part of the Bibliography
- no (1)
Keywords
- Branch-and-Cut (1)
- DIMACS Challenge (1)
- Mixed-Integer Programming (1)
- Steiner Tree Problem (1)
Institute
- Mathematical Optimization Methods (1) (remove)
In this article we describe the impact from embedding a 15 year old model for solving the Steiner tree problem in graphs in a state-of-the-art MIP-Framework, making the result run in a massively parallel environment and extending the model to solve as many variants as possible. We end up with a high-perfomance solver that is capable of solving previously unsolved instances and, in contrast to its predecessor, is freely available for academic research.