@article{RosenbergAgarwalaBouffardetal.2002, author = {Rosenberg, Marjorie and Agarwala, Richa and Bouffard, Gerard and Davis, Joie and Fiermonte, Giuseppe and Hilliard, Mark and Koch, Thorsten and Kalikin, Linda and Makalowska, Izabela and Morton, D. and Petty, Elizabeth and Weber, James and Palmieri, Ferdinando and Kelley, Richard and Sch{\"a}ffer, Alejandro and Biesecker, Leslie}, title = {Mutant deoxynucleotide carrier DNC is associated with congenital microcephaly}, volume = {32}, journal = {Nature Genetics}, number = {1}, doi = {10.1038/ng948}, pages = {175 -- 179}, year = {2002}, language = {en} } @inproceedings{EisenblaetterKochMartinetal.2003, author = {Eisenbl{\"a}tter, Andreas and Koch, Thorsten and Martin, Alexander and Achterberg, Tobias and F{\"u}genschuh, Armin and Koster, Arie M.C.A. and Wegel, Oliver and Wess{\"a}ly, Roland}, title = {Modelling Feasible Network Configurations for UMTS}, booktitle = {Telecommunications Network Design and Management}, editor = {Anandalingam, G. and Raghavan, S.}, publisher = {Kluver}, year = {2003}, language = {en} } @article{Koch2004, author = {Koch, Thorsten}, title = {The final NETLIB-LP results}, volume = {32}, journal = {Operations Research Letters}, number = {2}, publisher = {Elsevier / North-Holland}, doi = {10.1016/S0167-6377(03)00094-4}, pages = {138 -- 142}, year = {2004}, language = {en} } @inproceedings{EisenblaetterFuegenschuhGeerdesetal.2003, author = {Eisenbl{\"a}tter, Andreas and F{\"u}genschuh, Armin and Geerdes, Hans-Florian and Junglas, Daniel and Koch, Thorsten and Martin, Alexander}, title = {Optimisation Methods for UMTS Radio Network Planning}, booktitle = {Operation Research Proceedings 2003}, editor = {Ahr, Dino and Fahrion, Roland and Oswald, Marcus and Reinelt, Gerhard}, publisher = {Springer}, doi = {10.1007/978-3-642-17022-5_5}, pages = {31 -- 38}, year = {2003}, language = {en} } @inproceedings{BleyKochWessaely2004, author = {Bley, Andreas and Koch, Thorsten and Wess{\"a}ly, Roland}, title = {Large-Scale hierarchical networks: How to compute an optimal architecture?}, booktitle = {Networks 2004}, editor = {Kaindl, H.}, publisher = {VDE Verlag}, address = {Berlin}, isbn = {3-8007-2840-0}, pages = {429 -- 434}, year = {2004}, language = {en} } @inproceedings{KochWessaely2004, author = {Koch, Thorsten and Wess{\"a}ly, Roland}, title = {Hierarchical Infrastructure Planning in Networks}, booktitle = {Proceedings of the 3rd Conference on Applied Infrastructure Research, 9. October 2004, Berlin}, editor = {Elmer, Carl-Friedrich and von Hirschhausen, Christian}, year = {2004}, language = {en} } @phdthesis{Koch2004, author = {Koch, Thorsten}, title = {Rapid Mathematical Programming}, year = {2004}, language = {en} } @article{AchterbergKochMartin2005, author = {Achterberg, Tobias and Koch, Thorsten and Martin, Alexander}, title = {Branching Rules Revisited}, volume = {33}, journal = {Operations Research Letters}, number = {1}, publisher = {Elsevier / North-Holland}, doi = {10.1016/j.orl.2004.04.002}, pages = {42 -- 54}, year = {2005}, language = {en} } @article{Koch2006, author = {Koch, Thorsten}, title = {Mathematische Programmierung auf der {\"U}berholspur}, journal = {OR News}, number = {26}, pages = {36 -- 37}, year = {2006}, language = {en} } @article{KochMartin1998, author = {Koch, Thorsten and Martin, Alexander}, title = {Solving Steiner tree problems in graphs to optimality}, volume = {32}, journal = {Networks}, doi = {10.1002/(SICI)1097-0037(199810)32:3\%3C207::AID-NET5\%3E3.0.CO;2-O}, pages = {207 -- 232}, year = {1998}, language = {en} } @article{JohnstonKelleyCrawfordetal.2000, author = {Johnston, Jennifer and Kelley, Richard and Crawford, Thomas and Morton, D. and Agarwala, Richa and Koch, Thorsten and Sch{\"a}ffer, Alejandro and Francomano, Clair and Biesecker, Leslie}, title = {A novel nemaline myopathy in the Amish caused by a mutation in troponin T1}, volume = {67}, journal = {American Journal of Human Genetics}, pages = {814 -- 821}, year = {2000}, language = {en} } @incollection{KochMartinVoss2001, author = {Koch, Thorsten and Martin, Alexander and Voß, Stefan}, title = {SteinLib: An Updated Library on Steiner Tree Problems in Graphs}, booktitle = {Steiner Trees in Industry}, editor = {Du, D.-Z. and Cheng, X.}, publisher = {Kluwer}, doi = {10.1007/978-1-4613-0255-1_9}, pages = {285 -- 325}, year = {2001}, language = {en} } @article{AlbrechtCeynowaDegkwitzetal.2013, author = {Albrecht, Rita and Ceynowa, Klaus and Degkwitz, Andreas and Kende, Jiri and Koch, Thorsten and Messmer, Gabriele and Risch, Uwe and Rusch, Beate and Scheuerl, Robert and Voß, Michael}, title = {Cloudbasierte Infrastruktur f{\"u}r Bibliotheksdaten - auf dem Weg zu einer Neuordnung der deutschen Verbundlandschaft}, volume = {37}, journal = {Bibliothek Forschung und Praxis}, number = {3}, doi = {10.1515/bfp-2013-0044}, pages = {279 -- 287}, year = {2013}, abstract = {Im Oktober 2012 hatte die Deutsche Forschungsgemeinschaft (DFG) ein F{\"o}rderprogramm zur Neuausrichtung {\"u}berregionaler Informationsservices ausgeschrieben, um eine umfassende Reorganisation bestehender Infrastrukturen anzustoßen, die mit den Empfehlungen des Wissenschaftsrates zur Zukunft der bibliothekarischen Verbundsysteme in Deutschland gefordert wurde. Im Themenfeld „Bibliotheksdateninfrastruktur und Lokale Systeme" der DFG-Ausschreibung wurde das vom Hessischen Bibliotheksinformationssystem (HeBIS), vom Bibliotheksverbund Bayern (BVB) und vom Kooperativen Bibliotheksverbund Berlin-Brandenburg (KOBV) beantragte Vorhaben „Cloudbasierte Infrastruktur f{\"u}r Bibliotheksdaten" (CIB) bewilligt. Das Projekt zielt auf die {\"U}berf{\"u}hrung bibliothekarischer Workflows und Dienste in cloudbasierte Arbeitsumgebungen und die sukzessive Abl{\"o}sung traditioneller Verbund- und Lokalsysteme durch internationale Systemplattformen. Zu den Arbeitspaketen des Vorhabens geh{\"o}rt u. a. die Einbindung von Norm- und Fremddatenangeboten und von weiteren Services in diese Plattformen.}, language = {de} } @misc{BeckerBertelmannCeynowaetal.2016, author = {Becker, Pascal-Nicolas and Bertelmann, Roland and Ceynowa, Klaus and Christof, J{\"u}rgen and Dierkes, Thomas and Goltz-Fellgiebel, Julia Alexandra and Groß, Matthias and Heidrich, Regina and H{\"o}hnow, Tobias and Kassube, Michael and Koch, Thorsten and Kuberek, Monika and Landes, Lilian and Pampel, Heinz and Putnings, Markus and Rusch, Beate and Sch{\"a}ffler, Hildegard and Schobert, Dagmar and Schwab, Oliver and Schwidder, Jens and S{\"o}llner, Konstanze and Stoyanova, Tonka and Vierkant, Paul}, title = {Questionnaire for effective exchange of bibliographic metadata - current status of publishing houses}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-60419}, year = {2016}, abstract = {The project DeepGreen aims to realise better usage of green open access publication rights with regard to Alliance Licenses in Germany (https://www.nationallizenzen.de/open-access). Together with publishers who offer Alliance Licenses and authorized libraries, the project group intends to develop a prototype of a nearly fully automated workflow that covers the delivery of data from the publishers, including the article full texts, as well as the process of loading data into the institutional repositories of licensees. Further information about the project can be found within ZIB-Report 15-58, urn:nbn:de:0297-zib-56799. In order to become acquainted with publishers' processes for exchanging documents and metadata, the project group developed a questionnaire for an online survey. The publishing of this questionnaire is intended to demonstrate relevant aspects of the issue (e. g. methods of data exchange, protocols and interfaces) and to foster reuse of valuable questionnaire elements. The XML-file can be reused as a template, the PDF-file reproduces the original survey layout.}, subject = {Open Access}, language = {en} } @misc{BeckerBertelmannCeynowaetal.2016, author = {Becker, Pascal-Nicolas and Bertelmann, Roland and Ceynowa, Klaus and Christof, J{\"u}rgen and Dierkes, Thomas and Goltz-Fellgiebel, Julia Alexandra and Groß, Matthias and Heidrich, Regina and H{\"o}hnow, Tobias and Kassube, Michael and Koch, Thorsten and Kuberek, Monika and Landes, Lilian and Pampel, Heinz and Putnings, Markus and Rusch, Beate and Sch{\"a}ffler, Hildegard and Schobert, Dagmar and Schwab, Oliver and Schwidder, Jens and S{\"o}llner, Konstanze and Stoyanova, Tonka and Vierkant, Paul}, title = {DeepGreen - Metadata Schema for the exchange of publications between publishers and open access repositories. Version 1.1. June 2016}, issn = {1438-0064}, doi = {10.12752/3.dg.1.0}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-59580}, year = {2016}, abstract = {In 2011, important priorities were set to realize green publications in the open access movement in Germany. With financial support from the German Research Foundation (DFG), libraries negotiated Alliance licenses with publishers that guarantee extensive open access rights. Authors of institutions, that have therewith access to licensed journals, can freely publish their articles immediately or after a short embargo period in a repository of their choice. However, authors hesitantly use these open access rights. Also libraries - as managers of institutional and subject based repositories and thus legitimated representatives for the authors - only rarely make use of these rights. The aim of DeepGreen is to make the majority of those publications available online. Together with publishers of the Alliance licenses, the project consortium wants to develop a nearly fully automated workflow that covers both the delivery of data, including the full texts, of the publishers, as well as the data transformation to the necessary import formats and the loading process into the repositories. An intermediate "publication router" will serve as a distribution platform. The DeepGreen metadata schema contains metadata properties describing a wide range of deliverable bibliographic metadata from the Alliance license publishers (most common standards are JATS and CrossRef XML) as well as its compliance with technical, quality and metadata standards of the repositories. The schema includes required metadata elements and optional properties providing additional information.The metadata schema is aligned to the OCLC repository best practices ("Best Practices for CONTENTdm and other OAI-PMH compliant repositories: creating sharable metadata", URL: http://www.oclc.org/content/dam/support/wcdigitalcollectiongateway/MetadataBestPractices.pdf). The current version of the schema is subject to changes as the functional requirements and workflow practices are evolving during the project experiences and prototype production.}, language = {en} } @misc{AustConradRempelDegkwitzetal.2015, author = {Aust, Sonja and Conrad-Rempel, Steffi and Degkwitz, Andreas and Golz, Bettina and Hasler, Tim and Heiss, Alexandra and Keidel, Petra and Koch, Thorsten and Kuberek, Monika and Lill, Monika and Lohrum, Stefan and M{\"u}ller, Anja and Peters-Kottig, Wolfgang and Quitzsch, Nicole and Rusch, Beate and Schwidder, Jens and Sischke, Gabriele and Stanek, Ursula and Taylor, Viola and Weihe, Signe and Wyrwol, Christiane and Happel, Hans-Gerd}, title = {KOBV Jahresbericht 2013-2014}, volume = {2013-2014}, number = {2013-2014}, organization = {Kooperativer Bibliotheksverbund Berlin-Brandenburg (KOBV)}, issn = {0934-5892}, pages = {1 -- 56}, year = {2015}, abstract = {Der KOBV-Jahresbericht informiert r{\"u}ckblickend im 2-Jahres-Rhythmus {\"u}ber die bibliothekarisch-fachlichen Entwicklungen im Verbund und die Projekte des Kooperativen Bibliotheksverbunds Berlin-Brandenburg (KOBV).}, language = {de} } @misc{ChristofConradRempelDegkwitzetal.2017, author = {Christof, J{\"u}rgen and Conrad-Rempel, Steffi and Degkwitz, Andreas and Goltz-Fellgiebel, Julia Alexandra and Happel, Hans-Gerd and Hasler, Tim and Heiss, Alexandra and Kaminsky, Uta and Kant, Oliver and Kende, Jiř{\´i} and Koch, Thorsten and Kuberek, Monika and Lohrum, Stefan and M{\"u}ller, Anja and Mutter, Moritz and Peters-Kottig, Wolfgang and Quitzsch, Nicole and Rusch, Beate and Schwidder, Jens and Stanek, Ursula and Weihe, Signe and Zeyns, Andrea}, title = {KOBV Jahresbericht 2015-2016}, volume = {2015-2016}, number = {2015-2016}, organization = {Kooperativer Bibliotheksverbund Berlin-Brandenburg (KOBV)}, issn = {0934-5892}, pages = {1 -- 64}, year = {2017}, abstract = {Der KOBV-Jahresbericht informiert r{\"u}ckblickend im 2-Jahres-Rhythmus {\"u}ber die bibliothekarisch-fachlichen Entwicklungen im Verbund und die Projekte des Kooperativen Bibliotheksverbunds Berlin-Brandenburg (KOBV).}, language = {de} } @misc{BehrensBertelmannBoltzeetal.2019, author = {Behrens, Kathrin and Bertelmann, Roland and Boltze, Julia and Ceynowa, Klaus and Christof, J{\"u}rgen and Dierkes, Thomas and Goltz-Fellgiebel, Julia Alexandra and Groß, Matthias and Hammerl, Michaela and Haoua, Marsa and Heermann, Petra and Hoffmann, Cornelia and H{\"o}hnow, Tobias and Koch, Thorsten and Kuberek, Monika and Pampel, Heinz and Putnings, Markus and Rusch, Beate and Sch{\"a}ffler, Hildegard and Schwidder, Jens and S{\"o}llner, Konstanze and Staub, Hedda and Wannick, Eike}, title = {DeepGreen - Open Access Transformation: Eine Handreichung f{\"u}r institutionelle Repositorien}, issn = {1438-0064}, doi = {10.12752/7443}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-74438}, year = {2019}, abstract = {Mit dem DFG-gef{\"o}rderten Projekt DeepGreen soll eine automatisierte, rechtssichere L{\"o}sung entwickelt werden, um Artikeldaten von wissenschaftlichen Verlagen abzuholen und anschließend, nach Ablauf etwaiger lizenzrechtlicher Embargofristen, an berechtigte Repositorien zu verteilen und somit in den Open Access zu {\"u}berf{\"u}hren. Dabei liegt der Fokus auf den DFG-gef{\"o}rderten und {\"u}berregional verhandelten Allianz-Lizenzen, mit spezieller Open-Access-Komponente. Die vorliegende Handreichung richtet sich speziell an die Betreiber institutioneller Repositorien und stellt Empfehlungen und einen Workflow bereit, um eine erfolgreiche Ver{\"o}ffentlichung, der durch die DeepGreen-Datendrehscheibe zugeordneten Artikel, zu erm{\"o}glichen. Die Handreichung basiert auf den bisherigen Erfahrungen der DeepGreen-Projektbeteiligten.}, language = {de} } @misc{KochMartin1996, author = {Koch, Thorsten and Martin, Alexander}, title = {Solving Steiner Tree Problems in Graphs to Optimality}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-2526}, number = {SC-96-42}, year = {1996}, abstract = {In this paper we present the implementation of a branch-and-cut algorithm for solving Steiner tree problems in graphs. Our algorithm is based on an integer programming formulation for directed graphs and comprises preprocessing, separation algorithms and primal heuristics. We are able to solve all problem instances discussed in literature to optimality, including one to our knowledge not yet solved problem. We also report on our computational experiences with some very large Steiner tree problems arising from the design of electronic circuits. All test problems are gathered in a newly introduced library called {\em SteinLib} that is accessible via World Wide Web.}, language = {en} } @misc{PedersenLindnerRehfeldtetal.2025, author = {Pedersen, Jaap and Lindner, Niels and Rehfeldt, Daniel and Koch, Thorsten}, title = {Comparing Branching Rules for the Quota Steiner Tree Problem with Interference}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-101250}, year = {2025}, abstract = {Branching decisions play a crucial role in branch-and-bound algorithms for solving combinatorial optimization problems. In this paper, we investigate several branching rules applied to the Quota Steiner Tree Problem with Interference (QSTPI). The Quota Steiner Tree Problem (QSTP) generalizes the classical Steiner Tree Problem (STP) in graphs by seeking a minimum-cost tree that connects a subset of profit-associated vertices to meet a given quota. The extended version, QSTPI, introduces interference among vertices: Selecting certain vertices simultaneously reduces their individual contributions to the overall profit. This problem arises, for example, in positioning and connecting wind turbines, where turbines possibly shadow other turbines, reducing their energy yield. While exact solvers for standard STP-related problems often rely heavily on reduction techniques and cutting-plane methods - rarely generating large branch-and-bound trees - experiments reveal that large instances of QSTPI require significantly more branching to compute provably optimal solutions. In contrast to branching on variables, we utilize the combinatorial structure of the QSTPI by branching on the graph's vertices. We adapt classical and problem-specific branching rules and present a comprehensive computational study comparing the effectiveness of these branching strategies.}, language = {en} }