Heuristically guided search and chromosome matching
- 31 December 1970
- journal article
- research article
- Published by Elsevier in Artificial Intelligence
- Vol. 1 (3-4), 227-245
- https://doi.org/10.1016/0004-3702(70)90009-3
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Bi-Directional and Heuristic Search in Path Problems [Thesis]Published by Office of Scientific and Technical Information (OSTI) ,1969
- A Computer Programme for the Analysis of Human ChromosomesNature, 1966
- Maximum matching and a polyhedron with 0,1-verticesJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- Modification of Edmonds' maximum matching algorithmJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965
- An Algorithm for the Traveling Salesman ProblemOperations Research, 1963
- A note on two problems in connexion with graphsNumerische Mathematik, 1959