The Graph Coloring Problem: Exact and Heuristic Solutions

Exploring the classical discrete optimization problem through custom constructive heuristics and integer programming in Python

Graph coloring theory has a central position in discrete mathematics. It appears in many places with seemingly no or little connection to coloring. It deals with the fundamental problem of partitioning a set of objects into classes, according to certain rules (Jensen & Toft, 1995).

We can summarize the problem as follows: given …

data science editors pick operations-research optimization python