A branch-and-price algorithm for the robust graph coloring problem
From MaRDI portal
Publication:2448920
DOI10.1016/j.dam.2013.02.013zbMath1288.05077OpenAlexW2023840735MaRDI QIDQ2448920
Alain Hertz, Nicola Bianchessi, Claudia Archetti
Publication date: 5 May 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2013.02.013
Searching and sorting (68P10) Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Accelerating the branch-and-price algorithm using machine learning ⋮ New results on the robust coloring problem ⋮ A column generation based algorithm for the robust graph coloring problem ⋮ Three algorithms for graph locally harmonious colouring
Cites Work
- Unnamed Item
- STABULUS: A technique for finding stable sets in large graphs with tabu search
- On the capacitated vehicle routing problem
- The robust coloring problem.
- Solving the maximum clique problem using a tabu search approach
- An adaptive memory algorithm for the \(k\)-coloring problem
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- A Column Generation Approach for Graph Coloring
- AI 2003: Advances in Artificial Intelligence
- Column Generation
This page was built for publication: A branch-and-price algorithm for the robust graph coloring problem