3 papers
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…
cs.DM2018
A new Integer Linear Program for the Steiner Tree Problem with Revenues, Budget and Hop Constraints
Adalat Jabrayilov, Petra Mutzel
The Steiner tree problem with revenues, budgets and hop constraints (STPRBH) is a variant of the classical Steiner tree problem. This problem asks for a subtree in a given graph wi…
cs.CG2017
New Integer Linear Programming Models for the Vertex Coloring Problem
Adalat Jabrayilov, Petra Mutzel
The vertex coloring problem asks for the minimum number of colors that can be assigned to the vertices of a given graph such that for all vertices v the color of v is different fro…