A new ant colony optimization algorithm for the lower bound of sum coloring problem

DOI10.1007/s10852-012-9172-xzbMath1263.90130OpenAlexW2001789216MaRDI QIDQ1951174

Sidi Mohamed Douiri, Souad El Bernoussi

Publication date: 29 May 2013

Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10852-012-9172-x

zbMATH Keywords

ant colony optimizationminimum sum coloring problemlower bound for MSCP

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Coloring of graphs and hypergraphs (05C15)

Related Items

A systematic study on meta-heuristic approaches for solving the graph coloring problem ⋮ New variable neighborhood search method for minimum sum coloring problem on simple graphs ⋮ Gene selection via a new hybrid ant colony optimization algorithm for cancer classification in high-dimensional data

Cites Work

• An introduction to timetabling
• Graph colouring approaches for a satellite range scheduling problem
• On chromatic sums and distributed resource allocation
• Genetic and hybrid algorithms for graph coloring
• Hybrid evolutionary algorithms for graph coloring
• A graph coloring heuristic using partial solutions and a reactive tabu scheme
• A modified ant colony system for solving the travelling salesman problem with time windows
• An exact method for graph coloring
• Ant colony optimization theory: a survey
• Lower Bounds for the Minimal Sum Coloring Problem
• Tight bounds on the chromatic sum of a connected graph
• Ants can colour graphs
• A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item