Catalogue of Artificial Intelligence Techniques
Keywords: discrete optimisation
Author(s): Jim Doran
A solution technique for discrete optimisation problems which is widely used outside AI and is closely related to the A* Algorithm. The task is to find the optimally valued tip of a walkable search tree. A subtree of the search tree need not be searched if a computation at its root yields a bound for its set of tip values which implies that none of them can be optimal.
- Aho, A.V., Hopcroft, J.E. and Ullman, J.D., Data Structures and Algorithms
, Addison-Wesley, Reading, Mass., 1983, pp.330--336.