A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem

DOI10.1016/j.disopt.2011.05.003zbMath1235.90037OpenAlexW2039313449MaRDI QIDQ408371

Diego Delle Donne, Javier Marenco

Publication date: 5 April 2012

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2011.05.003

zbMATH Keywords

integer programmingfrequency assignmentadjacent colors

Mathematics Subject Classification ID

Integer programming (90C10) Communication networks in operations research (90B18) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Polyhedral studies of vertex coloring problems: the standard formulation

Uses Software

• ABACUS
• CALMA
• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A column generation and branch-and-cut algorithm for the channel assignment problem
• Cliques, holes and the vertex coloring polytope
• Erratum to ``Comparison of column generation models for channel assignment in cellular networks
• A cutting plane algorithm for graph coloring
• A branch-and-cut algorithm for graph coloring
• A Column Generation Approach for Graph Coloring
• The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
• Models and solution techniques for frequency assignment problems

This page was built for publication: A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem