An improved hybrid ant-local search algorithm for the partition graph coloring problem
type: Item
instance of: scholarly article
title: An improved hybrid ant-local search algorithm for the partition graph coloring problem
zbMATH Open document ID: 1334.90187
author: S. Fidanova
author: Petrica Pop
published in: Journal of Computational and Applied Mathematics
publication date: 2015-10-19T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6496047
zbMATH Keywords: partition graph coloring problem
zbMATH Keywords: metaheuristics
zbMATH Keywords: ant colony optimization
zbMATH Keywords: local search
MaRDI profile type: Publication
full work available at URL: j.cam.2015.04.030
OpenAlex ID: W1988985448
cites work: Generalized network design problems.
cites work: Generalized network design problems. Modeling and optimization.
cites work: On the generalized minimum spanning tree problem
cites work: A new relaxation method for the generalized minimum spanning tree problem
cites work: A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
cites work: An efficient transformation of the generalized vehicle routing problem
cites work: The generalized fixed-charge network design problem
cites work: Selective Graph Coloring in Some Special Classes of Graphs
cites work: On the complexity of the selective graph coloring problem in some special classes of graphs
cites work: A branch-and-cut algorithm for partition coloring
cites work: A branch-and-price approach for the partition coloring problem
cites work: Routing and wavelength assignment by partition colouring
cites work: Graph Colorings
cites work: Handbook of metaheuristics
DOI: 10.1016/J.CAM.2015.04.030
description: scientific article; zbMATH DE number 6496047