1 citations · 1 across the 1 of their papers we have counts for
3 papers
math.OC2022★ 1 cited
Faster exact solution of sparse MaxCut and QUBO problems
Daniel Rehfeldt, Thorsten Koch, Yuji Shinano
The maximum-cut problem is one of the fundamental problems in combinatorial optimization. With the advent of quantum computers, both the maximum-cut and the equivalent quadratic un…
math.OC2019
First Experiments with Structure-Aware Presolving for a Parallel Interior-Point Method
Ambros Gleixner, Nils-Christian Kempke, Thorsten Koch +2
In linear optimization, matrix structure can often be exploited algorithmically. However, beneficial presolving reductions sometimes destroy the special structure of a given proble…
math.OC2018
Reduction-based exact solution of prize-collecting Steiner tree problems
Daniel Rehfeldt, Thorsten Koch
The prize-collecting Steiner tree problem PCSTP is a well-known generalization of the classical Steiner tree problem in graphs, with a large number of practical applications. It at…