Heuristically guided search and chromosome matching

DOI10.1016/0004-3702(70)90009-3zbMath0205.49801OpenAlexW2160507868MaRDI QIDQ2542412

Ugo Montanari

Publication date: 1970

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0004-3702(70)90009-3

Mathematics Subject Classification ID

Artificial intelligence (68T99) Physiological, cellular and medical topics (92C99) Genetics and population dynamics (92D99)

Related Items

A method for computing heuristics in problem solving, A result on the computational complexity of heuristic estimates for the \(A^*\) algorithm

Cites Work

• A note on two problems in connexion with graphs
• Heuristic search viewed as path finding in a graph
• TWO THEOREMS IN GRAPH THEORY
• Paths, Trees, and Flowers
• Maximum matching and a polyhedron with 0,1-vertices
• Modification of Edmonds' maximum matching algorithm
• An Algorithm for the Traveling Salesman Problem
• An Appraisal of Some Shortest-Path Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item