A branch‐and‐price algorithm for the (k,c)‐coloring problem

DOI10.1002/net.21579zbMath1388.05070OpenAlexW1963960941MaRDI QIDQ4565766

Paula Zabala, Isabel Méndez-Díaz, Enrico Malaguti, Juan José Miranda-Bront

Publication date: 13 June 2018

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21579

zbMATH Keywords

heuristicscolumn generationcomputational experimentsvertex coloringbranch-and-pricefrequency assignmentmulticoloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

An exact algorithm for the edge coloring by total labeling problem ⋮ The minimum chromatic violation problem: a polyhedral approach

This page was built for publication: A branch‐and‐price algorithm for the (k,c)‐coloring problem