Evolutionary Computation in Combinatorial Optimization

DOI10.1007/B107115zbMATH Open1119.68445OpenAlexW1533372799MaRDI QIDQ5706014FDOQ5706014

Authors: Olfa Sammoud, Christine Solnon, Khaled Ghédira 

Publication date: 10 November 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Recommendations

• A comparative study of ant colony optimization and reactive search for graph matching problems
• An ACO algorithm for the graph coloring problem
• scientific article; zbMATH DE number 2090223
• Shape Matching Based on Ant Colony Optimization
• The graph matching problem

Mathematics Subject Classification ID

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

Cited In (6)

• An algorithm for graph optimal monomorphism
• Combining two pheromone structures for solving the car sequencing problem with ant colony optimization
• An efficient \(A^*\) based algorithm for optimal graph matching applied to computer vision
• Title not available (Why is that?)
• Isomorphism testing via polynomial-time graph extensions
• Shape Matching Based on Ant Colony Optimization

This page was built for publication: Evolutionary Computation in Combinatorial Optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5706014)