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

DOI10.1002/NET.21579zbMATH Open1388.05070OpenAlexW1963960941MaRDI QIDQ4565766FDOQ4565766

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

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

Recommendations

• A branch-and-price algorithm for the robust graph coloring problem
• A column generation based algorithm for the robust graph coloring problem
• An exact approach for the vertex coloring problem
• A survey on vertex coloring problems
• A branch-and-price approach for the partition coloring problem

zbMATH Keywords

heuristicscomputational experimentscolumn generationbranch-and-pricevertex coloringfrequency assignmentmulticoloring

Mathematics Subject Classification ID

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

Cited In (7)

• A Wide Branching Strategy for the Graph Coloring Problem
• An exact algorithm for the edge coloring by total labeling problem
• A branch-and-price algorithm for the robust graph coloring problem
• Upper and lower bounds based on linear programming for the b-coloring problem
• Solving the pricing problem in a branch-and-price algorithm for graph coloring using zero-suppressed binary decision diagrams
• The minimum chromatic violation problem: a polyhedral approach
• A column generation based algorithm for the robust graph coloring problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4565766)