The vertex coloring problem and its generalizations

DOI10.1007/s10288-008-0071-yzbMath1165.05010OpenAlexW2037817070MaRDI QIDQ1022440

Enrico Malaguti

Publication date: 22 June 2009

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: http://amsdottorato.unibo.it/340/1/TESI_Malaguti.pdf

zbMATH Keywords

vertex coloring problemefficiency of a solutionfairness of a solutionrouting problem in telecommunication networks

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

A Wide Branching Strategy for the Graph Coloring Problem ⋮ On properly ordered coloring of vertices in a vertex-weighted graph ⋮ Graph coloring-based approach for railway station design analysis and capacity determination ⋮ Adaptive feasible and infeasible tabu search for weighted vertex coloring ⋮ A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size ⋮ Exact weighted vertex coloring via branch-and-price

Uses Software

• CALMA

Cites Work

• Models and heuristic algorithms for a weighted vertex coloring problem
• Heuristics and lower bounds for the bin packing problem with conflicts
• Batch processing with interval graph compatibilities between tasks
• An evolutionary approach for bandwidth multicoloring problems
• Efficient and fair routing for mesh networks
• Algorithms for the Bin Packing Problem with Conflicts
• A Metaheuristic Approach for the Vertex Coloring Problem

This page was built for publication: The vertex coloring problem and its generalizations