Circular coloring of graphs via linear programming and tabu search

DOI10.1007/s10100-014-0345-8zbMath1339.05109OpenAlexW2068686341MaRDI QIDQ302132

Zsolt Tuza, Máté Baranyi

Publication date: 4 July 2016

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10100-014-0345-8

zbMATH Keywords

linear programmingtabu searchparallel computingcyclic schedulingcircular graph coloring

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Coloring of graphs and hypergraphs (05C15)

Related Items

\(L(3,2,1)\)-labeling of triangular and toroidal grids, A systematic study on meta-heuristic approaches for solving the graph coloring problem, Editorial

Uses Software

• Cbc
• GraphML

Cites Work

• Using tabu search techniques for graph coloring
• Supply chain management and advanced planning -- basics, overview and challenges
• Rado's Selection Principle: Applications to binary relations, graph and hypergraph colorings and partially ordered sets
• Staff scheduling and rostering: a review of applications, methods and models.
• Resource-sharing system scheduling and circular chromatic number
• Computational techniques of the simplex method
• The circular chromatic index of Goldberg snarks
• On the complexity of the circular chromatic number
• Star chromatic number
• Star chromatic numbers and products of graphs
• Tabu Search—Part I
• Tabu Search—Part II
• Planning and Scheduling in Manufacturing and Services
• Acyclic graph coloring and the complexity of the star chromatic number
• Graph Colorings
• Circular chromatic number: A survey
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item