Branch & Bound Formulation for Sequential and Parallel Game Tree Searching: Preliminary Results. - Laveen N. Kanal; Vipin Kumar 006 (IJCAI, 1981)

A General Paradigm for A.I. Search Procedures. - Dana S. Nau; Vipin Kumar 006; Laveen N. Kanal (AAAI, 1982)

The Composite Decision Process: A Unifying Formulation for Heuristic Search, Dynamic Programming and Branch & Bound Procedures. - Vipin Kumar 006; Laveen N. Kanal (AAAI, 1983)

A General Branch and Bound Formulation for Understanding and Synthesizing And/Or Tree Search Procedures. - Vipin Kumar 006; Laveen N. Kanal (Artif. Intell., 1983)

General Branch and Bound, and its Relation to A and AO. - Dana S. Nau; Vipin Kumar 006; Laveen N. Kanal (Artif. Intell., 1984)

Parallel Branch-and-Bound Formulations for AND/OR Tree Search. - Vipin Kumar 006; Laveen N. Kanal (IEEE Trans. Pattern Anal. Mach. Intell., 1984)