An evolutionary approach for bandwidth multicoloring problems

DOI10.1016/J.EJOR.2006.09.095MaRDI QIDQ2482742zbMATH OpenOpenAlexFDO

Authors Enrico Malaguti, Paolo Toth

Publication date 24 April 2008

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2006.09.095

zbMATH Keywords

bandwidth coloring problembandwidth multicoloring problemcombinatorial optimizationevolutionary algorithmtabu search

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Heuristics for the bandwidth colouring problem
• Integer and constraint programming approaches for providing optimality to the bandwidth multicoloring problem
• Two genetic algorithms for the bandwidth multicoloring problem
• A metaheuristic approach for the vertex coloring problem
• Approximation algorithms for bandwidth consecutive multicolorings (extended abstract)

Cites work

• \(T\)-colorings of graphs: recent results and open problems
• A graph coloring heuristic using partial solutions and a reactive tabu scheme
• A metaheuristic approach for the vertex coloring problem
• Generalised graph colouring by a hybrid of local search and constraint programming
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1305705 (Why is no real title available?)
• scientific article; zbMATH DE number 956854 (Why is no real title available?)
• Hybrid evolutionary algorithms for graph coloring
• Models and solution techniques for frequency assignment problems
• New methods to color the vertices of a graph
• On the use of some known methods for \(T\)-colorings of graphs
• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
• Tabu search for frequency assignment in mobile radio networks
• Two novel evolutionary formulations of the graph coloring problem

Cited in

(15)

• The vertex coloring problem and its generalizations
• Combinatorial optimization in system configuration design
• Cellular adaptive Petri net based on learning automata and its application to the vertex coloring problem
• Facet-inducing inequalities and a cut-and-branch for the bandwidth coloring polytope based on the orientation model
• Bandwidth consecutive multicolorings of graphs
• A new approach to the vertex coloring problem
• Two genetic algorithms for the bandwidth multicoloring problem
• A survey on vertex coloring problems
• A T-coloring algorithm based on multiagent evolution
• Integer and constraint programming approaches for providing optimality to the bandwidth multicoloring problem
• Multistart iterated tabu search for bandwidth coloring problem
• On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs
• Heuristics for the bandwidth colouring problem
• Efficient approximation algorithms for bandwidth consecutive multicolorings of graphs
• An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring

Describes a project that uses

Uses Software

• CALMA

This page was built for publication: An evolutionary approach for bandwidth multicoloring problems

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