A new ant colony optimization algorithm for the lower bound of sum coloring problem
type: Item
instance of: scholarly article
title: A new ant colony optimization algorithm for the lower bound of sum coloring problem
zbMATH Open document ID: 1263.90130
author: S. M. Douiri
author: S. El Bernoussi
published in: JMMA. Journal of Mathematical Modelling and Algorithms
publication date: 2013-05-29T00:00:00Z
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 6167984
zbMATH Keywords: minimum sum coloring problem
zbMATH Keywords: lower bound for MSCP
zbMATH Keywords: ant colony optimization
MaRDI profile type: Publication
full work available at URL: s10852-012-9172-x
OpenAlex ID: W2001789216
cites work: On chromatic sums and distributed resource allocation
cites work: A graph coloring heuristic using partial solutions and a reactive tabu scheme
cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
cites work: A modified ant colony system for solving the travelling salesman problem with time windows
cites work: Ants can colour graphs
cites work: An introduction to timetabling
cites work: Ant colony optimization theory: a survey
cites work: Q5480099
cites work: Q3097127
cites work: Genetic and hybrid algorithms for graph coloring
cites work: Hybrid evolutionary algorithms for graph coloring
cites work: Q4198056
cites work: Lower bounds for the minimal sum coloring problem
cites work: An exact method for graph coloring
cites work: Q3509574
cites work: Tight bounds on the chromatic sum of a connected graph
cites work: Graph colouring approaches for a satellite range scheduling problem
DOI: 10.1007/S10852-012-9172-X
Recommended article: An ant algorithm for the sum coloring problem
Recommended article: An improved ant colony optimisation heuristic for graph colouring
Recommended article: An ant colony algorithm for graph coloring and labeling problems
Recommended article: An ant-based algorithm for coloring graphs
Recommended article: Ant Local Search and its efficient adaptation to graph colouring
Recommended article: An Ant Algorithm for the Partition Graph Coloring Problem
Recommended article: A tabu search approach for the sum coloring problem
Recommended article: A new solution algorithm for improving performance of ant colony optimization
Recommended article: A memetic algorithm for the minimum sum coloring problem
description: scientific article; zbMATH DE number 6167984