Ant Local Search and its efficient adaptation to graph colouring
From MaRDI portal
Publication:3582660
DOI10.1057/jors.2009.27zbMath1193.90207OpenAlexW2053793706WikidataQ115430849 ScholiaQ115430849MaRDI QIDQ3582660
Matthieu Plumettaz, David Schindl, Nicolas Zufferey
Publication date: 2 September 2010
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/jors.2009.27
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
A systematic study on meta-heuristic approaches for solving the graph coloring problem, Solution Methods for Fuel Supply of Trains, Heuristics for a project management problem with incompatibility and assignment costs, An exact approach for the vertex coloring problem, Multi-coloring and job-scheduling with assignment and incompatibility costs, Graph Coloring Models and Metaheuristics for Packing Applications, Optimization by ant algorithms: possible roles for an individual ant, Improving the extraction and expansion method for large graph coloring, Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach, Probabilistic pursuits on graphs, INFORMED REACTIVE TABU SEARCH FOR GRAPH COLORING
