3 papers
cs.DM2026
Strong ILP Formulations for the p-Regions Problem
Daniel Faber, Jan-Henrik Haunert, Petra Mutzel
Regionalization is a fundamental task in spatial analysis that seeks to partition a larger area - such as a country - into smaller regions that are homogeneous with respect to a gi…
cs.DM2025
A Customized SAT-based Solver for Graph Coloring
Timo Brand, Daniel Faber, Stephan Held +1
We introduce ZykovColor, a novel SAT-based algorithm to solve the graph coloring problem working on top of an encoding that mimics the Zykov tree. Our method is based on an approac…
cs.AI2024
SAT Encoding of Partial Ordering Models for Graph Coloring Problems
Daniel Faber, Adalat Jabrayilov, Petra Mutzel
In this paper, we suggest new SAT encodings of the partial-ordering based ILP model for the graph coloring problem (GCP) and the bandwidth coloring problem (BCP). The GCP asks for…