Thorsten Koch

Orcid: 0000-0002-1967-0077

According to our database1, Thorsten Koch authored at least 79 papers between 1998 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Optimal discrete pipe sizing for tree-shaped CO<sub>2</sub> networks.
OR Spectr., December, 2024

Specification and verification of security protocols and their utilization in scenario-based requirements engineering
PhD thesis, 2024

How many clues to give? A bilevel formulation for the minimum Sudoku clue problem.
Oper. Res. Lett., 2024

Security Belts: A Maturity Model for DevOps Teams to Increase the Software Security of their Product - An Experience Report.
Proceedings of the 30th Americas Conference on Information Systems: Elevating Life through Digital Social Entrepreneurship, 2024

2023
Faster exact solution of sparse MaxCut and QUBO problems.
Math. Program. Comput., September, 2023

Enabling Research through the SCIP Optimization Suite 8.0.
ACM Trans. Math. Softw., June, 2023

Implications, conflicts, and reductions for Steiner trees.
Math. Program., February, 2023

Article's scientific prestige: Measuring the impact of individual articles in the web of science.
J. Informetrics, February, 2023

Adaptive Cut Selection in Mixed-Integer Linear Programming.
Open J. Math. Optim., January, 2023

PySCIPOpt-ML: Embedding Trained Machine Learning Models into Mixed-Integer Programs.
CoRR, 2023

Branching via Cutting Plane Selection: Improving Hybrid Branching.
CoRR, 2023

Cutting Plane Selection with Analytic Centers and Multiregression.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2023

2022
Length-constrained cycle partition with an application to UAV routing.
Optim. Methods Softw., 2022

Optimal connected subgraphs: Integer programming formulations and polyhedra.
Networks, 2022

Generative deep learning for decision making in gas networks.
Math. Methods Oper. Res., 2022

On the Exact Solution of Prize-Collecting Steiner Tree Problems.
INFORMS J. Comput., 2022

A massively parallel interior-point solver for LPs with generalized arrowhead structure, and applications to energy system models.
Eur. J. Oper. Res., 2022

Progress in mathematical programming solvers from 2001 to 2020.
EURO J. Comput. Optim., 2022

Variational Bayesian inference for network autoregression models.
Comput. Stat. Data Anal., 2022

How far are German companies in improving security through static program analysis tools?
Proceedings of the IEEE Secure Development Conference, 2022

Integrating Security Protocols in Scenario-based Requirements Specifications.
Proceedings of the 10th International Conference on Model-Driven Engineering and Software Development, 2022

APDCM 2022 Keynote Talk: Solving QUBOs on Digital and Quantum Computers.
Proceedings of the IEEE International Parallel and Distributed Processing Symposium, 2022

2021
MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library.
Math. Program. Comput., 2021

The maximum diversity assortment selection problem.
Math. Methods Oper. Res., 2021

AppSecure.nrw Software Security Study.
CoRR, 2021

Blending Hydrogen into Natural Gas: An Assessment of the Capacity of the German Gas Grid.
Proceedings of the Operations Research Proceedings 2021, Selected Papers of the International Conference of the Swiss, German and Austrian Operations Research Societies (SVOR/ASRO, GOR e.V., ÖGOR), University of Bern, Switzerland, August 31, 2021

2020
Softwareentwicklung wie am Fließband.
Proceedings of the Software Engineering 2020, 2020

Scenario-based specification of security protocols and transformation to security model checkers.
Proceedings of the MoDELS '20: ACM/IEEE 23rd International Conference on Model Driven Engineering Languages and Systems, 2020

Minimum Cycle Partition with Length Requirements.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2020

2019
Combining NP-Hard Reduction Techniques and Strong Heuristics in an Exact Algorithm for the Maximum-Weight Connected Subgraph Problem.
SIAM J. Optim., 2019

Reduction techniques for the prize collecting Steiner tree problem and the maximum-weight connected subgraph problem.
Networks, 2019

Was fehlt (bisher) um Apps sicher zu entwickeln? - Prozesse, Werkzeuge und Schulungen für sichere Apps by Design.
Proceedings of the Projektmanagement und Vorgehensmodelle 2019 - Neue Vorgehensmodelle in Projekten, 2019

First Experiments with Structure-Aware Presolving for a Parallel Interior-Point Method.
Proceedings of the Operations Research Proceedings 2019, 2019

Building Optimal Steiner Trees on Supercomputers by Using up to 43, 000 Cores.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2019

2018
From feasibility to improvement to proof: three phases of solving mixed-integer programs.
Optim. Methods Softw., 2018

Preface: Special issue of MOA 2016.
J. Glob. Optim., 2018

A system to evaluate gas network capacities: Concepts and implementation.
Eur. J. Oper. Res., 2018

Towards Scenario-Based Security Requirements Engineering for Cyber-Physical Systems.
Proceedings of the Software Technologies: Applications and Foundations, 2018

Formal, Model- and Scenario-based Requirement Patterns.
Proceedings of the 6th International Conference on Model-Driven Engineering and Software Development, 2018

Parallel Solvers for Mixed Integer Linear Optimization.
Proceedings of the Handbook of Parallel Constraint Reasoning., 2018

2017
SCIP-Jack - a solver for STP and variants with parallelization extensions.
Math. Program. Comput., 2017

GasLib - A Library of Gas Network Instances.
Data, 2017

SCIP-Jack - A Solver for STP and Variants with Parallelization Extensions: An Update.
Proceedings of the Operations Research Proceedings 2017, 2017

Optimizing Large-Scale Linear Energy System Problems with Block Diagonal Structure by Using Parallel Interior-Point Methods.
Proceedings of the Operations Research Proceedings 2017, 2017

Model-Driven STEP Application Protocol Extensions Combined with Feature Modeling Considering Geometrical Information.
Proceedings of the Model-Driven Engineering and Software Development, 2017

Flexible Specification of STEP Application Protocol Extensions and Automatic Derivation of Tool Capabilities.
Proceedings of the 5th International Conference on Model-Driven Engineering and Software Development, 2017

Forecasting Natural Gas Flows in Large Networks.
Proceedings of the Machine Learning, Optimization, and Big Data, 2017

2016
Valid inequalities for the topology optimization problem in gas network design.
OR Spectr., 2016

Solving Open MIP Instances with ParaSCIP on Supercomputers Using up to 80, 000 Cores.
Proceedings of the 2016 IEEE International Parallel and Distributed Processing Symposium, 2016

2015
Validation of nominations in gas network optimization: models, methods, and solutions.
Optim. Methods Softw., 2015

Progress in presolving for mixed integer programming.
Math. Program. Comput., 2015

Chapter 1: Introduction.
Proceedings of the Evaluating Gas Network Capacities, 2015

Chapter 7: The specialized MINLP approach.
Proceedings of the Evaluating Gas Network Capacities, 2015

Chapter 15: Perspectives.
Proceedings of the Evaluating Gas Network Capacities, 2015

Chapter 3: Regulatory rules for gas markets in Germany and other European countries.
Proceedings of the Evaluating Gas Network Capacities, 2015

Chapter 4: State of the art in evaluating gas network capacities.
Proceedings of the Evaluating Gas Network Capacities, 2015

Chapter 5: Mathematical optimization for evaluating gas network capacities.
Proceedings of the Evaluating Gas Network Capacities, 2015

2014
Solving Hard MIPLIB2003 Problems with ParaSCIP on Supercomputers: An Update.
Proceedings of the 2014 IEEE International Parallel & Distributed Processing Symposium Workshops, 2014

Generating EAST-ADL Event Chains from Scenario-Based Requirements Specifications.
Proceedings of the Software Architecture - 8th European Conference, 2014

2013
A hybrid branch-and-bound approach for exact rational mixed-integer programming.
Math. Program. Comput., 2013

2012
Could we use a million cores to solve an integer program?
Math. Methods Oper. Res., 2012

Steiner tree packing revisited.
Math. Methods Oper. Res., 2012

2011
MIPLIB 2010.
Math. Program. Comput., 2011

An Exact Rational Mixed-Integer Programming Solver.
Proceedings of the Integer Programming and Combinatoral Optimization, 2011

2010
ParaSCIP: A Parallel Extension of SCIP.
Proceedings of the Competence in High Performance Computing 2010, 2010

2009
Comparing MIQCP Solvers to a Specialised Algorithm for Mine Production Scheduling.
Proceedings of the Modeling, 2009

2008
Optimizing the landside operation of a container terminal.
OR Spectr., 2008

Mathematical methods for physical layout of printed circuit boards: an overview.
OR Spectr., 2008

Counting Solutions of Integer Programs Using Unrestricted Subtree Detection.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2008

Constraint Integer Programming: A New Approach to Integrate CP and MIP.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2008

2006
MIPLIB 2003.
Oper. Res. Lett., 2006

UMTS radio network evaluation and optimization beyond snapshots.
Math. Methods Oper. Res., 2006

Integer Programming Approaches to Access and Backbone IP Network Planning.
Proceedings of the Modeling, 2006

2005
Branching rules revisited.
Oper. Res. Lett., 2005

Rapid Mathematical Programming or How to Solve Sudoku Puzzles in a Few Seconds.
Proceedings of the Operations Research Proceedings 2005, 2005

2004
Rapid mathematical programming.
PhD thesis, 2004

The final N<sub>ETLIB</sub>-LP results.
Oper. Res. Lett., 2004

2001
Creating the Architecture of a Translator Framework for Robot Programming Languages.
Proceedings of the 2001 IEEE International Conference on Robotics and Automation, 2001

1998
Solving Steiner tree problems in graphs to optimality.
Networks, 1998


  Loading...