Optimization by ant algorithms: possible roles for an individual ant
type: Item
instance of: scholarly article
title: Optimization by ant algorithms: possible roles for an individual ant
zbMATH Open document ID: 1254.90308
author: Nicolas Zufferey
published in: Optimization Letters
publication date: 2012-11-07T00:00:00Z
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6102935
zbMATH Keywords: metaheuristics
zbMATH Keywords: ant algorithms
zbMATH Keywords: graph coloring
MaRDI profile type: Publication
full work available at URL: s11590-011-0327-x
OpenAlex ID: W2083951772
cites work: Handbook of applied optimization
cites work: A survey on vertex coloring problems
cites work: Ants can colour graphs
cites work: Ant Local Search and its efficient adaptation to graph colouring
cites work: The oracle penalty method
cites work: A graph coloring heuristic using partial solutions and a reactive tabu scheme
cites work: A memetic algorithm for graph coloring
cites work: A metaheuristic approach for the vertex coloring problem
DOI: 10.1007/S11590-011-0327-X
description: scientific article; zbMATH DE number 6102935