@article{GleixnerHendelGamrathetal., author = {Gleixner, Ambros and Hendel, Gregor and Gamrath, Gerald and Achterberg, Tobias and Bastubbe, Michael and Berthold, Timo and Christophel, Philipp M. and Jarck, Kati and Koch, Thorsten and Linderoth, Jeff and L{\"u}bbecke, Marco and Mittelmann, Hans and Ozyurt, Derya and Ralphs, Ted and Salvagnin, Domenico and Shinano, Yuji}, title = {MIPLIB 2017: Data-Driven Compilation of the 6th Mixed-Integer Programming Library}, series = {Mathematical Programming Computation}, volume = {13}, journal = {Mathematical Programming Computation}, number = {3}, doi = {10.1007/s12532-020-00194-3}, pages = {443 -- 490}, abstract = {We report on the selection process leading to the sixth version of the Mixed Integer Programming Library. Selected from an initial pool of over 5,000 instances, the new MIPLIB 2017 collection consists of 1,065 instances. A subset of 240 instances was specially selected for benchmarking solver performance. For the first time, the compilation of these sets was done using a data-driven selection process supported by the solution of a sequence of mixed integer optimization problems, which encoded requirements on diversity and balancedness with respect to instance features and performance data.}, language = {en} } @article{RehfeldtKoch, author = {Rehfeldt, Daniel and Koch, Thorsten}, title = {On the exact solution of prize-collecting Steiner tree problems}, series = {INFORMS Journal on Computing}, journal = {INFORMS Journal on Computing}, doi = {10.1287/ijoc.2021.1087}, language = {en} } @inproceedings{RehfeldtKoch, author = {Rehfeldt, Daniel and Koch, Thorsten}, title = {Implications, conflicts, and reductions for Steiner trees}, series = {Integer Programming and Combinatorial Optimization: 22th International Conference, IPCO 2021}, booktitle = {Integer Programming and Combinatorial Optimization: 22th International Conference, IPCO 2021}, doi = {10.1007/978-3-030-73879-2_33}, pages = {473 -- 487}, language = {en} } @article{HoppmannBaumHenningsZitteletal., author = {Hoppmann-Baum, Kai and Hennings, Felix and Zittel, Janina and Gotzes, Uwe and Spreckelsen, Eva-Maria and Spreckelsen, Klaus and Koch, Thorsten}, title = {An Optimization Approach for the Transient Control of Hydrogen Transport Networks}, series = {Mathematical Methods of Operations Research}, journal = {Mathematical Methods of Operations Research}, number = {Special Issue on Energy Networks}, language = {en} } @article{HoppmannBaumHenningsLenzetal.2020, author = {Hoppmann-Baum, Kai and Hennings, Felix and Lenz, Ralf and Gotzes, Uwe and Heinecke, Nina and Spreckelsen, Klaus and Koch, Thorsten}, title = {Optimal Operation of Transient Gas Transport Networks}, series = {Optimization and Engineering}, volume = {22}, journal = {Optimization and Engineering}, doi = {10.1007/s11081-020-09584-x}, pages = {735 -- 781}, year = {2020}, abstract = {In this paper, we describe an algorithmic framework for the optimal operation of transient gas transport networks consisting of a hierarchical MILP formulation together with a sequential linear programming inspired post-processing routine. Its implementation is part of the KOMPASS decision support system, which is currently used in an industrial setting. Real-world gas transport networks are controlled by operating complex pipeline intersection areas, which comprise multiple compressor units, regulators, and valves. In the following, we introduce the concept of network stations to model them. Thereby, we represent the technical capabilities of a station by hand-tailored artificial arcs and add them to network. Furthermore, we choose from a predefined set of flow directions for each network station and time step, which determines where the gas enters and leaves the station. Additionally, we have to select a supported simple state, which consists of two subsets of artificial arcs: Arcs that must and arcs that cannot be used. The goal is to determine a stable control of the network satisfying all supplies and demands. The pipeline intersections, that are represented by the network stations, were initially built centuries ago. Subsequently, due to updates, changes, and extensions, they evolved into highly complex and involved topologies. To extract their basic properties and to model them using computer-readable and optimizable descriptions took several years of effort. To support the dispatchers in controlling the network, we need to compute a continuously updated list of recommended measures. Our motivation for the model presented here is to make fast decisions on important transient global control parameters, i.e., how to route the flow and where to compress the gas. Detailed continuous and discrete technical control measures realizing them, which take all hardware details into account, are determined in a subsequent step. In this paper, we present computational results from the KOMPASS project using detailed real-world data.}, language = {en} } @article{BertholdKochShinano2021, author = {Berthold, Timo and Koch, Thorsten and Shinano, Yuji}, title = {MILP. Try. Repeat.}, series = {Proceedings of the 13th International Conference on the Practice and Theory of Automated Timetabling - PATAT 2021}, volume = {2}, journal = {Proceedings of the 13th International Conference on the Practice and Theory of Automated Timetabling - PATAT 2021}, year = {2021}, language = {en} } @inproceedings{RehfeldtShinanoKoch, author = {Rehfeldt, Daniel and Shinano, Yuji and Koch, Thorsten}, title = {SCIP-Jack: An exact high performance solver for Steiner tree problems in graphs and related problems}, series = {Modeling, Simulation and Optimization of Complex Processes HPSC 2018}, booktitle = {Modeling, Simulation and Optimization of Complex Processes HPSC 2018}, publisher = {Springer}, doi = {10.1007/978-3-030-55240-4_10}, abstract = {The Steiner tree problem in graphs is one of the classic combinatorial optimization problems. Furthermore, many related problems, such as the rectilinear Steiner tree problem or the maximum-weight connected subgraph problem, have been described in the literature—with a wide range of practical applications. To embrace this wealth of problem classes, the solver SCIP-JACK has been developed as an exact framework for classic Steiner tree and 11 related problems. Moreover, the solver comes with both shared- and distributed memory extensions by means of the UG framework. Besides its versatility, SCIP-JACK is highly competitive for most of the 12 problem classes it can solve, as for instance demonstrated by its top ranking in the recent PACE 2018 Challenge. This article describes the current state of SCIP-JACK and provides up-to-date computational results, including several instances that can now be solved for the first time to optimality.}, language = {en} } @misc{RuschPetersKottigBoltzeetal., author = {Rusch, Beate and Peters-Kottig, Wolfgang and Boltze, Julia and Brandtner, Andreas and Degkwitz, Andreas and Kirsch, Simona and Koch, Thorsten and Lohrum, Stefan and M{\"u}ller, Anja and Mutter, Moritz and Seeliger, Frank and Stanek, Ursula}, title = {KOBV Jahresbericht 2019-2020}, address = {Berlin}, organization = {Kooperativer Bibliotheksverbund Berlin-Brandenburg}, issn = {1438-0064}, doi = {10.12752/8247}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-82474}, pages = {84}, abstract = {Der aktuelle KOBV-Jahresbericht informiert dar{\"u}ber, was in den Mitgliedsbibliotheken und Partnerprojekten in den letzten beiden Jahren passiert ist und was sich in der Verbundzentrale und in der Bibliothekslandschaft {\"a}ndert. Die Ausgabe 2019/2020 enth{\"a}lt den Schwerpunktteil »Digitalisierung« mit verschiedenen Perspektiven auf die digitale Arbeitswelt.}, language = {de} } @misc{BertelmannBoltzeCeynowaetal., author = {Bertelmann, Roland and Boltze, Julia and Ceynowa, Klaus and Christof, J{\"u}rgen and Faensen, Katja and Groß, Matthias and Hoffmann, Cornelia and Koch, Thorsten and Kuberek, Monika and Lohrum, Stefan and Pampel, Heinz and Putnings, Markus and Retter, Regina and Rusch, Beate and Sch{\"a}ffler, Hildegard and S{\"o}llner, Konstanze and Steffen, Ronald and Wannick, Eike}, title = {DeepGreen: Open-Access-Transformation in der Informationsinfrastruktur - Anforderungen und Empfehlungen, Version 1.0}, issn = {1438-0064}, doi = {10.12752/8150}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-81503}, abstract = {DeepGreen ist ein Service, der es teilnehmenden institutionellen Open-Access-Repositorien,Open-Access-Fachrepositorien und Forschungsinformationssystemen erleichtert, f{\"u}r sie relevante Verlagspublikationen in zyklischer Abfolge mithilfe von Schnittstellen Open Access zur Verf{\"u}gung zu stellen. Die entsprechende Bandbreite an Relationen zwischen den Akteuren, diverse lizenzrechtliche Rahmenbedingungen sowie technische Anforderungen gestalten das Thema komplex. Ziel dieser Handreichung ist es, neben all diesen Themen, die begleitend beleuchtet werden, im Besonderen Empfehlungen f{\"u}r die reibungslose Nutzung der Daten{\"u}bertragung zu liefern. Außerdem werden mithilfe einer vorangestellten Workflow- Evaluierung Unterschiede und Besonderheiten in den Arbeitsschritten bei institutionellen Open-Access-Repositorien und Open-Access-Fachrepositorien aufgezeigt und ebenfalls mit Empfehlungen angereichert.}, language = {de} } @misc{CharoussetBrignolvanAckooijOudjaneetal., author = {Charousset-Brignol, Sandrine and van Ackooij, Wim and Oudjane, Nadia and Daniel, Dominique and Noceir, Slimane and Haus, Utz-Uwe and Lazzaro, Alfio and Frangioni, Antonio and Lobato, Rafael and Ghezelsoflu, Ali and Iardella, Niccol{\`o} and Galli, Laura and Gorgone, Enrico and dell'Amico, Mauro and Giannelos, Spyros and Moreira, Alex and Strbac, Goran and Borozan, Stefan and Falugi, Paula and Pudjianto, Danny and Wyrwoll, Lothar and Schmitt, Carlo and Franken, Marco and Beulertz, Daniel and Schwaeppe, Henrik and Most, Dieter and Y{\"u}ksel-Erg{\"u}n, Inci and Zittel, Janina and Koch, Thorsten}, title = {Synergistic approach of multi-energy models for a European optimal energy system management tool}, series = {The Project Repository Journal}, volume = {9}, journal = {The Project Repository Journal}, pages = {113 -- 116}, language = {en} }