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

DOI10.1007/BF02023000MaRDI QIDQ2367012zbMATH OpenOpenAlexFDO

Authors D. G. 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 algorithmfrequency assignmentgraph coloringheuristic proceduresimulated annealingtabu search

Mathematics Subject Classification ID

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

Recommendations

• \(T\)-colorings of graphs
• \(T\)-colorings of graphs: recent results and open problems
• Publication:4863459
• \(T\)-coloring of certain networks
• t-tone colorings of graphs
• scientific article; zbMATH DE number 810478
• Some topological methods in graph coloring theory
• Finite-dimensional T-colorings of graphs
• The method of coloring in graphs and its application
• scientific article; zbMATH DE number 975370

Cites work

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

Cited in

(16)

• Lower bounding techniques for frequency assignment
• Improving heuristics for the frequency assignment problem
• A tabu search algorithm for computing an operational timetable
• Bounds for the frequency assignment problem
• An enumerative algorithm for the frequency assignment problem
• A tabu search algorithm for frequency assignment
• An evolutionary approach for bandwidth multicoloring problems
• A T-coloring algorithm based on multiagent evolution
• Algorithms for the generalized weighted frequency assignment problem
• scientific article; zbMATH DE number 4160759 (Why is no real title available?)
• Models and methods for frequency assignment with cumulative interference constraints
• scientific article; zbMATH DE number 597813 (Why is no real title available?)
• scientific article; zbMATH DE number 867661 (Why is no real title available?)
• Bounds on spectrum graph coloring
• Heuristics for the bandwidth colouring problem
• Models and solution techniques for frequency assignment problems

This page was built for publication: On the use of some known methods for \(T\)-colorings of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2367012)