default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThorsten Koch
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[b2]Thorsten Koch:
Specification and verification of security protocols and their utilization in scenario-based requirements engineering. Paderborn University, Germany, 2024- [j37]Gennesaret Tjusila
, Mathieu Besançon, Mark Turner, Thorsten Koch:
How many clues to give? A bilevel formulation for the minimum Sudoku clue problem. Oper. Res. Lett. 54: 107105 (2024) - [j36]Jaap Pedersen, Thi Thai Le, Thorsten Koch, Janina Zittel:
Optimal discrete pipe sizing for tree-shaped CO2 networks. OR Spectr. 46(4): 1163-1187 (2024) - [c31]Samira Taaibi, Stefan Dziwok, Lars Hermerschmidt, Thorsten Koch, Sven Merschjohann, Mark Vollmary:
Security Belts: A Maturity Model for DevOps Teams to Increase the Software Security of their Product - An Experience Report. AMCIS 2024 - 2023
- [j35]Ying Chen, Thorsten Koch, Nazgul Zakiyeva, Kailiang Liu, Zhitong Xu, Chun-Houh Chen, Junji Nakano, Keisuke Honda:
Article's scientific prestige: Measuring the impact of individual articles in the web of science. J. Informetrics 17(1): 101379 (2023) - [j34]Daniel Rehfeldt, Thorsten Koch:
Implications, conflicts, and reductions for Steiner trees. Math. Program. 197(2): 903-966 (2023) - [j33]Daniel Rehfeldt, Thorsten Koch, Yuji Shinano:
Faster exact solution of sparse MaxCut and QUBO problems. Math. Program. Comput. 15(3): 445-470 (2023) - [j32]Mark Turner, Thorsten Koch, Felipe Serrano, Michael Winkler:
Adaptive Cut Selection in Mixed-Integer Linear Programming. Open J. Math. Optim. 4: 1-28 (2023) - [j31]Ksenia Bestuzheva, Mathieu Besançon, Weikun Chen, Antonia Chmiela, Tim Donkiewicz, Jasper van Doornmalen, Leon Eifler, Oliver Gaul, Gerald Gamrath, Ambros M. Gleixner, Leona Gottwald, Christoph Graczyk, Katrin Halbig, Alexander Hoen, Christopher Hojny, Rolf van der Hulst, Thorsten Koch, Marco E. Lübbecke, Stephen J. Maher, Frederic Matter, Erik Mühmer, Benjamin Müller, Marc E. Pfetsch, Daniel Rehfeldt, Steffan Schlein, Franziska Schlösser, Felipe Serrano, Yuji Shinano, Boro Sofranac, Mark Turner, Stefan Vigerske, Fabian Wegscheider, Philipp Wellner, Dieter Weninger, Jakob Witzig:
Enabling Research through the SCIP Optimization Suite 8.0. ACM Trans. Math. Softw. 49(2): 22:1-22:21 (2023) - [c30]Mark Turner, Timo Berthold, Mathieu Besançon, Thorsten Koch:
Cutting Plane Selection with Analytic Centers and Multiregression. CPAIOR 2023: 52-68 - [i10]Gennesaret Tjusila, Mathieu Besançon, Mark Turner, Thorsten Koch:
How Many Clues To Give? A Bilevel Formulation For The Minimum Sudoku Clue Problem. CoRR abs/2305.01697 (2023) - [i9]Mark Turner, Timo Berthold, Mathieu Besançon, Thorsten Koch:
Branching via Cutting Plane Selection: Improving Hybrid Branching. CoRR abs/2306.06050 (2023) - [i8]Mark Turner, Antonia Chmiela, Thorsten Koch, Michael Winkler:
PySCIPOpt-ML: Embedding Trained Machine Learning Models into Mixed-Integer Programs. CoRR abs/2312.08074 (2023) - 2022
- [j30]Wei-Ting Lai, Ray-Bing Chen, Ying Chen, Thorsten Koch:
Variational Bayesian inference for network autoregression models. Comput. Stat. Data Anal. 169: 107406 (2022) - [j29]Thorsten Koch, Timo Berthold, Jaap Pedersen, Charlie Vanaret:
Progress in mathematical programming solvers from 2001 to 2020. EURO J. Comput. Optim. 10: 100031 (2022) - [j28]Daniel Rehfeldt, Hannes Hobbie, David Schönheit, Thorsten Koch, Dominik Möst, Ambros M. Gleixner:
A massively parallel interior-point solver for LPs with generalized arrowhead structure, and applications to energy system models. Eur. J. Oper. Res. 296(1): 60-71 (2022) - [j27]Daniel Rehfeldt, Thorsten Koch:
On the Exact Solution of Prize-Collecting Steiner Tree Problems. INFORMS J. Comput. 34(2): 872-889 (2022) - [j26]Lovis Anderson, Mark Turner, Thorsten Koch:
Generative deep learning for decision making in gas networks. Math. Methods Oper. Res. 95(3): 503-532 (2022) - [j25]Daniel Rehfeldt, Henriette Franz, Thorsten Koch:
Optimal connected subgraphs: Integer programming formulations and polyhedra. Networks 80(3): 314-332 (2022) - [j24]Kai Hoppmann-Baum, Oleg Burdakov, Gioni Mexi, Carl Johan Casselgren, Thorsten Koch:
Length-constrained cycle partition with an application to UAV routing. Optim. Methods Softw. 37(6): 2080-2116 (2022) - [c29]Thorsten Koch, Daniel Rehfeldt, Yuji Shinano:
APDCM 2022 Keynote Talk: Solving QUBOs on Digital and Quantum Computers. IPDPS Workshops 2022: 413 - [c28]Thorsten Koch, Sascha Trippel, Stefan Dziwok, Eric Bodden:
Integrating Security Protocols in Scenario-based Requirements Specifications. MODELSWARD 2022: 15-25 - [c27]Goran Piskachev, Stefan Dziwok, Thorsten Koch, Sven Merschjohann, Eric Bodden:
How far are German companies in improving security through static program analysis tools? SecDev 2022: 7-15 - [i7]Daniel Rehfeldt, Thorsten Koch, Yuji Shinano:
Faster exact solution of sparse MaxCut and QUBO problems. CoRR abs/2202.02305 (2022) - [i6]Ying Chen, Thorsten Koch, Nazgul Zakiyeva, Kailiang Liu, Zhitong Xu, Chun-Houh Chen, Junji Nakano, Keisuke Honda:
Article's Scientific Prestige: measuring the impact of individual articles in the Web of Science. CoRR abs/2202.08695 (2022) - [i5]Mark Turner, Thorsten Koch, Felipe Serrano, Michael Winkler:
Adaptive Cut Selection in Mixed-Integer Linear Programming. CoRR abs/2202.10962 (2022) - [i4]Goran Piskachev, Stefan Dziwok, Thorsten Koch, Sven Merschjohann, Eric Bodden:
How far are German companies in improving security through static program analysis tools? CoRR abs/2208.06136 (2022) - [i3]Mark Turner, Timo Berthold, Mathieu Besançon, Thorsten Koch:
Cutting Plane Selection with Analytic Centers and Multiregression. CoRR abs/2212.07231 (2022) - 2021
- [j23]Felix Prause, Kai Hoppmann-Baum, Boris Defourny, Thorsten Koch:
The maximum diversity assortment selection problem. Math. Methods Oper. Res. 93(3): 521-554 (2021) - [j22]Ambros M. Gleixner, Gregor Hendel, Gerald Gamrath, Tobias Achterberg, Michael Bastubbe, Timo Berthold, Philipp Christophel, Kati Jarck, Thorsten Koch, Jeff T. Linderoth, Marco E. Lübbecke, Hans D. Mittelmann, Derya B. Özyurt, Ted K. Ralphs, Domenico Salvagnin, Yuji Shinano:
MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library. Math. Program. Comput. 13(3): 443-490 (2021) - [c26]Daniel Rehfeldt, Thorsten Koch:
Implications, Conflicts, and Reductions for Steiner Trees. IPCO 2021: 473-487 - [c25]Jaap Pedersen, Kai Hoppmann-Baum, Janina Zittel, Thorsten Koch:
Blending Hydrogen into Natural Gas: An Assessment of the Capacity of the German Gas Grid. OR 2021: 182-187 - [i2]Lovis Anderson, Mark Turner, Thorsten Koch:
Generative deep learning for decision making in gas networks. CoRR abs/2102.02125 (2021) - [i1]Stefan Dziwok, Thorsten Koch, Sven Merschjohann, Boris Budweg, Sebastian Leuer:
AppSecure.nrw Software Security Study. CoRR abs/2108.11752 (2021) - 2020
- [c24]Kai Hoppmann, Gioni Mexi, Oleg Burdakov, Carl Johan Casselgren, Thorsten Koch:
Minimum Cycle Partition with Length Requirements. CPAIOR 2020: 273-282 - [c23]Thorsten Koch, Stefan Dziwok, Jörg Holtmann, Eric Bodden:
Scenario-based specification of security protocols and transformation to security model checkers. MoDELS 2020: 343-353 - [c22]Thorsten Koch, Matthias Meyer, Masud Fazal-Baqaie, Hubert Runschke:
Softwareentwicklung wie am Fließband. SE 2020: 209-214
2010 – 2019
- 2019
- [j21]Daniel Rehfeldt, Thorsten Koch, Stephen J. Maher:
Reduction techniques for the prize collecting Steiner tree problem and the maximum-weight connected subgraph problem. Networks 73(2): 206-233 (2019) - [j20]Daniel Rehfeldt, Thorsten Koch:
Combining NP-Hard Reduction Techniques and Strong Heuristics in an Exact Algorithm for the Maximum-Weight Connected Subgraph Problem. SIAM J. Optim. 29(1): 369-398 (2019) - [c21]Yuji Shinano, Daniel Rehfeldt, Thorsten Koch:
Building Optimal Steiner Trees on Supercomputers by Using up to 43, 000 Cores. CPAIOR 2019: 529-539 - [c20]Ambros M. Gleixner, Nils-Christian Kempke, Thorsten Koch, Daniel Rehfeldt, Svenja Uslu:
First Experiments with Structure-Aware Presolving for a Parallel Interior-Point Method. OR 2019: 105-111 - [c19]Katharina Altemeier, Matthias Becker, Stefan Dziwok, Thorsten Koch, Sven Merschjohann:
Was fehlt (bisher) um Apps sicher zu entwickeln? - Prozesse, Werkzeuge und Schulungen für sichere Apps by Design. PVM 2019: 247-252 - 2018
- [j19]Benjamin Hiller, Thorsten Koch, Lars Schewe, Robert Schwarz, Jonas Schweiger:
A system to evaluate gas network capacities: Concepts and implementation. Eur. J. Oper. Res. 270(3): 797-808 (2018) - [j18]Thorsten Koch, Ya-Feng Liu, Jiming Peng:
Preface: Special issue of MOA 2016. J. Glob. Optim. 70(1): 1-3 (2018) - [j17]Timo Berthold, Gregor Hendel, Thorsten Koch:
From feasibility to improvement to proof: three phases of solving mixed-integer programs. Optim. Methods Softw. 33(3): 499-517 (2018) - [c18]Markus Fockel, Jörg Holtmann, Thorsten Koch, David Schmelter:
Formal, Model- and Scenario-based Requirement Patterns. MODELSWARD 2018: 311-318 - [c17]Thorsten Koch:
Towards Scenario-Based Security Requirements Engineering for Cyber-Physical Systems. STAF Workshops 2018: 633-643 - [p7]Ted K. Ralphs, Yuji Shinano, Timo Berthold, Thorsten Koch:
Parallel Solvers for Mixed Integer Linear Optimization. Handbook of Parallel Constraint Reasoning 2018: 283-336 - 2017
- [j16]Martin Schmidt, Denis Aßmann, Robert Burlacu, Jesco Humpola, Imke Joormann, Nikolaos Kanelakis, Thorsten Koch, Djamal Oucherif, Marc E. Pfetsch, Lars Schewe, Robert Schwarz, Mathias Sirvent:
GasLib - A Library of Gas Network Instances. Data 2(4): 40 (2017) - [j15]Gerald Gamrath, Thorsten Koch, Stephen J. Maher, Daniel Rehfeldt, Yuji Shinano:
SCIP-Jack - a solver for STP and variants with parallelization extensions. Math. Program. Comput. 9(2): 231-296 (2017) - [c16]Mauro Dell'Amico, Natalia Selini Hadjidimitriou, Thorsten Koch, Milena Petkovic:
Forecasting Natural Gas Flows in Large Networks. MOD 2017: 158-171 - [c15]Thorsten Koch, Jörg Holtmann, Timo Lindemann:
Flexible Specification of STEP Application Protocol Extensions and Automatic Derivation of Tool Capabilities. MODELSWARD 2017: 53-64 - [c14]Thorsten Koch, Jörg Holtmann, Timo Lindemann:
Model-Driven STEP Application Protocol Extensions Combined with Feature Modeling Considering Geometrical Information. MODELSWARD (Revised Selected Papers) 2017: 173-197 - [c13]Daniel Rehfeldt, Thorsten Koch:
SCIP-Jack - A Solver for STP and Variants with Parallelization Extensions: An Update. OR 2017: 191-196 - [c12]Thomas Breuer, Michael R. Bussieck, Karl-Kiên Cao, Felix Cebulla, Frederik Fiand, Hans Christian Gils, Ambros M. Gleixner, Dmitry Khabi, Thorsten Koch, Daniel Rehfeldt, Manuel Wetzel:
Optimizing Large-Scale Linear Energy System Problems with Block Diagonal Structure by Using Parallel Interior-Point Methods. OR 2017: 641-647 - 2016
- [j14]Jesco Humpola, Armin Fügenschuh, Thorsten Koch:
Valid inequalities for the topology optimization problem in gas network design. OR Spectr. 38(3): 597-631 (2016) - [c11]Yuji Shinano, Tobias Achterberg, Timo Berthold, Stefan Heinz, Thorsten Koch, Michael Winkler:
Solving Open MIP Instances with ParaSCIP on Supercomputers Using up to 80, 000 Cores. IPDPS 2016: 770-779 - [e2]Gert-Martin Greuel, Thorsten Koch, Peter Paule, Andrew J. Sommese:
Mathematical Software - ICMS 2016 - 5th International Conference, Berlin, Germany, July 11-14, 2016, Proceedings. Lecture Notes in Computer Science 9725, Springer 2016, ISBN 978-3-319-42431-6 [contents] - 2015
- [j13]Gerald Gamrath, Thorsten Koch, Alexander Martin, Matthias Miltenberger, Dieter Weninger:
Progress in presolving for mixed integer programming. Math. Program. Comput. 7(4): 367-398 (2015) - [j12]Marc E. Pfetsch, Armin Fügenschuh, Björn Geißler, Nina Geißler, Ralf Gollmer, Benjamin Hiller, Jesco Humpola, Thorsten Koch, Thomas Lehmann, Alexander Martin, Antonio Morsi, Jessica Rövekamp, Lars Schewe, Martin Schmidt, Rüdiger Schultz, Robert Schwarz, Jonas Schweiger, Claudia Stangl, Marc Christian Steinbach, Stefan Vigerske, Bernhard M. Willert:
Validation of nominations in gas network optimization: models, methods, and solutions. Optim. Methods Softw. 30(1): 15-53 (2015) - [p6]Jessica Rövekamp, Thorsten Koch, Marc E. Pfetsch:
Chapter 1: Introduction. Evaluating Gas Network Capacities 2015: 3-16 - [p5]Uwe Gotzes, Nina Heinecke, Jessica Rövekamp, Benjamin Hiller, Thorsten Koch:
Chapter 3: Regulatory rules for gas markets in Germany and other European countries. Evaluating Gas Network Capacities 2015: 45-64 - [p4]Dagmar Bargmann, Mirko Ebbers, Nina Heinecke, Veronika Kühl, Antje Pelzer, Jessica Rövekamp, Klaus Spreckelsen, Thorsten Koch, Marc E. Pfetsch:
Chapter 4: State of the art in evaluating gas network capacities. Evaluating Gas Network Capacities 2015: 65-84 - [p3]Alexander Martin, Lars Schewe, Thorsten Koch, Marc E. Pfetsch:
Chapter 5: Mathematical optimization for evaluating gas network capacities. Evaluating Gas Network Capacities 2015: 87-102 - [p2]Jesco Humpola, Armin Fügenschuh, Thomas Lehmann, Ralf Lenz, Robert Schwarz, Jonas Schweiger, Benjamin Hiller, Thorsten Koch:
Chapter 7: The specialized MINLP approach. Evaluating Gas Network Capacities 2015: 123-143 - [p1]Christine Hayn, Jesco Humpola, Jonas Schweiger, Klaus Spreckelsen, Thorsten Koch, Lars Schewe:
Chapter 15: Perspectives. Evaluating Gas Network Capacities 2015: 317-323 - [e1]Thorsten Koch, Benjamin Hiller, Marc E. Pfetsch, Lars Schewe:
Evaluating Gas Network Capacities. MOS-SIAM Series on Optimization 21, SIAM 2015, ISBN 978-1-611-97368-6 [contents] - 2014
- [c10]Thorsten Koch, Jörg Holtmann, Julien DeAntoni:
Generating EAST-ADL Event Chains from Scenario-Based Requirements Specifications. ECSA 2014: 146-153 - [c9]Yuji Shinano, Tobias Achterberg, Timo Berthold, Stefan Heinz, Thorsten Koch, Michael Winkler:
Solving Hard MIPLIB2003 Problems with ParaSCIP on Supercomputers: An Update. IPDPS Workshops 2014: 1552-1561 - 2013
- [j11]William J. Cook, Thorsten Koch, Daniel E. Steffy, Kati Wolter:
A hybrid branch-and-bound approach for exact rational mixed-integer programming. Math. Program. Comput. 5(3): 305-344 (2013) - 2012
- [j10]Thorsten Koch, Ted K. Ralphs, Yuji Shinano:
Could we use a million cores to solve an integer program? Math. Methods Oper. Res. 76(1): 67-93 (2012) - [j9]Nam-Dung Hoàng, Thorsten Koch:
Steiner tree packing revisited. Math. Methods Oper. Res. 76(1): 95-123 (2012) - 2011
- [j8]Thorsten Koch, Tobias Achterberg, Erling Andersen, Oliver Bastert, Timo Berthold, Robert E. Bixby, Emilie Danna, Gerald Gamrath, Ambros M. Gleixner, Stefan Heinz, Andrea Lodi, Hans D. Mittelmann, Ted K. Ralphs, Domenico Salvagnin, Daniel E. Steffy, Kati Wolter:
MIPLIB 2010. Math. Program. Comput. 3(2): 103-163 (2011) - [c8]William J. Cook, Thorsten Koch, Daniel E. Steffy, Kati Wolter:
An Exact Rational Mixed-Integer Programming Solver. IPCO 2011: 104-116 - 2010
- [c7]Yuji Shinano, Tobias Achterberg, Timo Berthold, Stefan Heinz, Thorsten Koch:
ParaSCIP: A Parallel Extension of SCIP. CHPC 2010: 135-148
2000 – 2009
- 2009
- [c6]Andreas Bley, Ambros M. Gleixner, Thorsten Koch, Stefan Vigerske:
Comparing MIQCP Solvers to a Specialised Algorithm for Mine Production Scheduling. HPSC 2009: 25-39 - 2008
- [j7]Gary Froyland, Thorsten Koch, Nicole Megow, Emily Duane, Howard Wren:
Optimizing the landside operation of a container terminal. OR Spectr. 30(1): 53-75 (2008) - [j6]Nadine Abboud, Martin Grötschel, Thorsten Koch:
Mathematical methods for physical layout of printed circuit boards: an overview. OR Spectr. 30(3): 453 (2008) - [c5]Tobias Achterberg, Timo Berthold, Thorsten Koch, Kati Wolter:
Constraint Integer Programming: A New Approach to Integrate CP and MIP. CPAIOR 2008: 6-20 - [c4]Tobias Achterberg, Stefan Heinz, Thorsten Koch:
Counting Solutions of Integer Programs Using Unrestricted Subtree Detection. CPAIOR 2008: 278-282 - 2006
- [j5]Andreas Eisenblätter, Hans-Florian Geerdes, Thorsten Koch, Alexander Martin, Roland Wessäly:
UMTS radio network evaluation and optimization beyond snapshots. Math. Methods Oper. Res. 63(1): 1-29 (2006) - [j4]Tobias Achterberg, Thorsten Koch, Alexander Martin:
MIPLIB 2003. Oper. Res. Lett. 34(4): 361-372 (2006) - [c3]Andreas Bley, Thorsten Koch:
Integer Programming Approaches to Access and Backbone IP Network Planning. HPSC 2006: 87-110 - 2005
- [j3]Tobias Achterberg, Thorsten Koch, Alexander Martin:
Branching rules revisited. Oper. Res. Lett. 33(1): 42-54 (2005) - [c2]Thorsten Koch:
Rapid Mathematical Programming or How to Solve Sudoku Puzzles in a Few Seconds. OR 2005: 21-26 - 2004
- [b1]Thorsten Koch:
Rapid mathematical programming. Berlin Institute of Technology, 2004 - [j2]Thorsten Koch:
The final NETLIB-LP results. Oper. Res. Lett. 32(2): 138-142 (2004) - 2001
- [c1]Eckhard Freund, Bernd Luedemann-Ravit, Oliver Stern, Thorsten Koch:
Creating the Architecture of a Translator Framework for Robot Programming Languages. ICRA 2001: 187-192
1990 – 1999
- 1998
- [j1]Thorsten Koch, Alexander Martin:
Solving Steiner tree problems in graphs to optimality. Networks 32(3): 207-232 (1998)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 20:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
