A branch and price algorithm for list coloring problem

DOI10.1016/j.entcs.2019.08.054OpenAlexW2977564817WikidataQ113317375 ScholiaQ113317375MaRDI QIDQ2132397

Daniel Severín, Mauro Lucci, Graciela L. Nasini

Publication date: 27 April 2022

Full work available at URL: https://arxiv.org/abs/1812.00040

zbMATH Keywords

list coloringbranch and priceweighted problem

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Graph theory (05Cxx)

Related Items (1)

Unnamed Item

Cites Work

• An exact approach for the vertex coloring problem
• A new \textsf{DSATUR}-based algorithm for exact vertex coloring
• A cutting plane algorithm for graph coloring
• A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs
• Safe Lower Bounds for Graph Coloring
• Set Partitioning via Inclusion-Exclusion
• New methods to color the vertices of a graph
• A Column Generation Approach for Graph Coloring
• Graph Colorings
• Parameterized Algorithms
• Exploring the complexity boundary between coloring and list-coloring
• Unnamed Item

This page was built for publication: A branch and price algorithm for list coloring problem