67 citations · 77 across the 8 of their papers we have counts for
9 papers
Race, Exchange, Improve: Finding high-quality MIP solutions quickly
Gioni Mexi, Daniel Rehfeldt
Mixed-integer programming (MIP) is a cornerstone in applied optimization, both in industry and academia. Recently, there has been increased attention to finding strong primal solut…
Distributed Parallel Structure-Aware Presolving for Arrowhead Linear Programs
Nils-Christian Kempke, Stephen J Maher, Daniel Rehfeldt +3
We present a structure-aware parallel presolve framework for arrowhead linear programs (AHLPs) in high-performance computing (HPC) environments, integrated into the parallel interi…
Integrated Wind Farm Design: Optimizing Turbine Placement and Cable Routing with Wake Effects
Jaap Pedersen, Niels Lindner, Daniel Rehfeldt +1
An accelerated deployment of renewable energy sources is crucial for a successful transformation of the current energy system, with wind energy playing a key role in this transitio…
A Massively Parallel Interior-Point Method for Arrowhead Linear Programs with Local Linking Structure
Nils-Christian Kempke, Daniel Rehfeldt, Thorsten Koch
In practice, non-specialized interior point algorithms often cannot utilize the massively parallel compute resources offered by modern many- and multi-core compute platforms. Howev…
An efficient solver for large-scale onshore wind farm siting including cable routing
Jaap Pedersen, Jann Michael Weinand, Chloi Syranidou +1
Existing planning approaches for onshore wind farm siting and grid integration often do not meet minimum cost solutions or social and environmental considerations. In this paper, w…
Enabling Research through the SCIP Optimization Suite 8.0
Ksenia Bestuzheva, Mathieu Besançon, Wei-Kun Chen +32
The SCIP Optimization Suite provides a collection of software packages for mathematical optimization centered around the constraint integer programming framework SCIP. The focus of…
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…
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…
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…