A comparative study of ant colony optimization and reactive search for graph matching problems

DOI10.1007/11730095_20zbMath1401.68293OpenAlexW1571258174MaRDI QIDQ1742614

Olfa Sammoud, Sébastien Sorlin, Christine Solnon, Khaled Ghédira

Publication date: 12 April 2018

Full work available at URL: https://doi.org/10.1007/11730095_20

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (2)

Combining two pheromone structures for solving the car sequencing problem with ant colony optimization ⋮ Using local similarity measures to efficiently address approximate graph matching

This page was built for publication: A comparative study of ant colony optimization and reactive search for graph matching problems