On the use of some known methods for \(T\)-colorings of graphs

DOI10.1007/BF02023000zbMath0771.68089OpenAlexW2015194943MaRDI QIDQ2367012

Daniel Costa

Publication date: 16 August 1993

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02023000

zbMATH Keywords

branch-and-bound algorithmsimulated annealingtabu searchgraph coloringfrequency assignmentheuristic procedure

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)

Related Items

A tabu search algorithm for computing an operational timetable ⋮ Bounds for the frequency assignment problem ⋮ Algorithms for the generalized weighted frequency assignment problem ⋮ A tabu search algorithm for frequency assignment ⋮ Models and methods for frequency assignment with cumulative interference constraints ⋮ An enumerative algorithm for the frequency assignment problem ⋮ An evolutionary approach for bandwidth multicoloring problems ⋮ Models and solution techniques for frequency assignment problems ⋮ Lower bounding techniques for frequency assignment ⋮ Improving heuristics for the frequency assignment problem

Cites Work

• Using tabu search techniques for graph coloring
• Some experiments with simulated annealing for coloring graphs
• A thermodynamically motivated simulation procedure for combinatorial optimization problems
• Tabu search techniques. A tutorial and an application to neural networks
• Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths
• Chromatic scheduling and frequency assignment
• A tabu search algorithm for computing an operational timetable
• The tabu search metaheuristic: How we used it
• EPCOT: An efficient procedure for coloring optimally with Tabu Search
• Solving real-life vehicle routing problems efficiently using tabu search
• Consecutive colorings of graphs
• New methods to color the vertices of a graph