activity
20162024
most citedEnabling Research through the SCIP Optimization Suite 8.0

67 citations · 68 across the 7 of their papers we have counts for

collaborators

8 papers

math.OC2024

A diving heuristic for mixed-integer problems with unbounded semi-continuous variables

Katrin Halbig, Alexander Hoen, Ambros Gleixner +2

Semi-continuous decision variables arise naturally in many real-world applications. They are defined to take either value zero or any value within a specified range, and occur main…

math.OC2024

Branch and Cut for Partitioning a Graph into a Cycle of Clusters

Leon Eifler, Jakob Witzig, Ambros Gleixner

In this paper we study formulations and algorithms for the cycle clustering problem, a partitioning problem over the vertex set of a directed graph with nonnegative arc weights tha…

math.OC2023★ 67 cited

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…

math.OC2019

Conflict-Driven Heuristics for Mixed Integer Programming

Jakob Witzig, Ambros Gleixner

Two essential ingredients of modern mixed-integer programming (MIP) solvers are diving heuristics that simulate a partial depth-first search in a branch-and-bound search tree and c…

math.OC2019

A Status Report on Conflict Analysis in Mixed Integer Nonlinear Programming

Jakob Witzig, Timo Berthold, Stefan Heinz

Mixed integer nonlinear programs (MINLPs) are arguably among the hardest optimization problems, with a wide range of applications. MINLP solvers that are based on linear relaxation…

math.OC2019

Local Rapid Learning for Integer Programs

Timo Berthold, Peter J. Stuckey, Jakob Witzig

Conflict learning algorithms are an important component of modern MIP and CP solvers. But strong conflict information is typically gained by depth-first search. While this is the n…

math.OC2016★ 1 cited

Experiments with Conflict Analysis in Mixed Integer Programming

Jakob Witzig, Timo Berthold, Stefan Heinz

The analysis of infeasible subproblems plays an import role in solving mixed integer programs (MIPs) and is implemented in most major MIP solvers. There are two fundamentally diffe…

cs.DS2016

Mixed-Integer Programming for Cycle Detection in Non-reversible Markov Processes

Isabel Beckenbach, Leon Eifler, Konstantin Fackeldey +4

In this paper, we present a new, optimization-based method to exhibit cyclic behavior in non-reversible stochastic processes. While our method is general, it is strongly motivated…