Abstract
The author compares the methods of graph searching, including shortest path algorithms, the incorporation of heuristic techniques and formal mathematical approaches, and the branch and bound methods. The heuristic concept adapted by both management scientists and artificial intelligence researchers is the key issue in this comparative study.
| Original language | American English |
|---|---|
| Pages (from-to) | 107-112 |
| Journal | 交大管理學報 |
| Volume | 1 |
| Issue number | 2 |
| State | Published - 1981 |