General branch and bound, and its relation to A* and AO*

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback
Take a look at the new version of this page: [ beta version ]. Tell us what you think.

General branch and bound, and its relation to A* and AO*

Source

Artificial Intelligence archive
Volume 23 , Issue 1 (May 1984) table of contents

Pages: 29 - 58

Year of Publication: 1984

ISSN:0004-3702

Authors

Dana S. Nau	Univ. of Maryland, College Park
Vipin Kumar	Univ. of Maryland, College Park
Laveen Kanal	Univ. of Maryland, College Park

Publisher

Elsevier Science Publishers Ltd. Essex, UK

Bibliometrics

Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Citation Count: 8

Additional Information:

cited by index terms review collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	10.1016/0004-3702(84)90004-3

CITED BY 8

	P. P. Chakrabarti , S. Ghose , S. C. DeSarkar, Best first search in and/or graphs, Proceedings of the 1988 ACM sixteenth annual conference on Computer science, p.256-261, February 1988, Atlanta, Georgia, United States
	S. J. Noronha , V. V. S. Sarma, Knowledge-Based Approaches for Scheduling Problems: A Survey, IEEE Transactions on Knowledge and Data Engineering, v.3 n.2, p.160-171, June 1991
	Vipin Kumar, Integrating knowledge in problem solving search procedures, Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge, p.5-10, January 1984
	Guo-Jie Li , Benjamin W. Wah, Computational Efficiency of Parallel Combinatorial OR-Tree Searches, IEEE Transactions on Software Engineering, v.16 n.1, p.13-31, January 1990
	Wu Jigang , Thambipillai Srikanthan, An efficient data structure for branch-and-bound algorithm, Information Sciences—Informatics and Computer Science: An International Journal, v.167 n.1-4, p.233-237, 2 December 2004
	Nachum Dershowitz, Program abstraction and instantiation, ACM Transactions on Programming Languages and Systems (TOPLAS), v.7 n.3, p.446-477, July 1985
	Qiang Yang , Dana S. Nau, Preprocessing search spaces for branch and bound search, Proceedings of the 11th international joint conference on Artificial intelligence, p.349-353, August 20-25, 1989, Detroit, Michigan
	Jilles S. Dibangoye , Abdel-Illah Mouaddib , Brahim Chai-draa, Point-based incremental pruning heuristic for solving finite-horizon DEC-POMDPs, Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems, May 10-15, 2009, Budapest, Hungary

INDEX TERMS

Classification:
G. Mathematics of Computing
G.2 DISCRETE MATHEMATICS

I. Computing Methodologies
I.2 ARTIFICIAL INTELLIGENCE
I.2.8 Problem Solving, Control Methods, and Search
Subjects: Heuristic methods

General Terms:
Algorithms, Performance, Verification

REVIEW

"Mohamed E. El-Hawary : Reviewer"

A sufficiently wide class of problems involves finding an optimal element of a discrete set of elements such that a real-valued objective function is minimized. This general formulation of the optimization problem arises in decisionmaking, opera more...

Collaborative Colleagues:

Dana S. Nau: colleagues

Vipin Kumar: colleagues

Laveen Kanal: colleagues

Adobe Acrobat

QuickTime

Windows Media Player

Real Player