{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T23:35:01Z","timestamp":1773704101892,"version":"3.50.1"},"reference-count":30,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1983,3,1]],"date-time":"1983-03-01T00:00:00Z","timestamp":415324800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[1983,3]]},"DOI":"10.1016\/s0004-3702(83)80009-5","type":"journal-article","created":{"date-parts":[[2006,12,3]],"date-time":"2006-12-03T12:12:21Z","timestamp":1165147941000},"page":"179-198","source":"Crossref","is-referenced-by-count":56,"title":["A general branch and bound formulation for understanding and synthesizing and\/or tree search procedures"],"prefix":"10.1016","volume":"21","author":[{"given":"Vipin","family":"Kumar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laveen N.","family":"Kanal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0004-3702(83)80009-5_bib1_1","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1287\/opre.16.2.442","article-title":"A note on the branch-and-bound principle","volume":"16","author":"Balas","year":"1968","journal-title":"Oper. Res."},{"key":"10.1016\/S0004-3702(83)80009-5_bib1_2","doi-asserted-by":"crossref","first-page":"886","DOI":"10.1287\/opre.16.4.886","article-title":"A note on the branch-and-bound principle","volume":"16","author":"Balas","year":"1968","journal-title":"Oper. Res."},{"key":"10.1016\/S0004-3702(83)80009-5_bib2","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0004-3702(79)90003-1","article-title":"The B* tree search algorithm: a best-first proof procedure","volume":"12","author":"Berliner","year":"1979","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(83)80009-5_bib3","article-title":"Algorithms for the parallel search of game trees","author":"Campbell","year":"1981"},{"key":"10.1016\/S0004-3702(83)80009-5_bib4","series-title":"Proc. Second Internat. Joint Conf. Artificial Intelligence","first-page":"641","article-title":"Branch-and-bound and beyond","author":"Hall","year":"1971"},{"key":"10.1016\/S0004-3702(83)80009-5_bib5","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1016\/0022-247X(76)90096-2","article-title":"On the optimality of algorithms for finite state sequential decision processes","volume":"53","author":"Ibaraki","year":"1976","journal-title":"J. Math. Anal. Appl."},{"key":"10.1016\/S0004-3702(83)80009-5_bib6","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1145\/322003.322010","article-title":"The power of dominance relations in branch and bound algorithms","volume":"24","author":"Ibaraki","year":"1977","journal-title":"J. ACM"},{"key":"10.1016\/S0004-3702(83)80009-5_bib7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(78)90197-3","article-title":"Branch-and-bound procedure and state-space representation of combinatorial optimization problems","volume":"36","author":"Ibaraki","year":"1978","journal-title":"Inform. Control"},{"key":"10.1016\/S0004-3702(83)80009-5_bib8","series-title":"Proc. Seventh Internal. Joint Conf. Artificial Intelligence","first-page":"569","article-title":"A branch and bound formulation for sequential and parallel game tree searching","author":"Kanal","year":"1981"},{"key":"10.1016\/S0004-3702(83)80009-5_bib9","series-title":"Proc. IEEE Computer Society Conf. Pattern Recognition and Image Processing","first-page":"452","article-title":"Parallel implementations of a structural analysis algorithm","author":"Kanal","year":"1981"},{"key":"10.1016\/S0004-3702(83)80009-5_bib10","volume":"Vol. 1","author":"Knuth","year":"1968"},{"key":"10.1016\/S0004-3702(83)80009-5_bib11","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0004-3702(75)90019-3","article-title":"An analysis of alpha-beta pruning","volume":"6","author":"Knuth","year":"1975","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(83)80009-5_bib12","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1145\/321796.321808","article-title":"Characterization and theoretical comparison of branch and bound algorithms for permutation problems","volume":"21","author":"Kohler","year":"1974","journal-title":"J. ACM"},{"key":"10.1016\/S0004-3702(83)80009-5_bib13","article-title":"A unified approach to problem solving search procedures","author":"Kumar","year":"1983"},{"key":"10.1016\/S0004-3702(83)80009-5_bib14","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1287\/opre.14.4.699","article-title":"Branch-and-bound methods: a survey","volume":"14","author":"Lawler","year":"1966","journal-title":"Oper. Res."},{"key":"10.1016\/S0004-3702(83)80009-5_bib15","series-title":"Proc. Third Internat. Joint Conf. Artificial Intelligence","first-page":"1","article-title":"Additive AND\/OR graphs","author":"Martelli","year":"1973"},{"key":"10.1016\/S0004-3702(83)80009-5_bib16","doi-asserted-by":"crossref","first-page":"1025","DOI":"10.1145\/359657.359664","article-title":"Optimizing decision trees through heuristically guided search","volume":"21","author":"Martelli","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/S0004-3702(83)80009-5_bib17_1","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1287\/opre.18.1.24","article-title":"Branch and bound methods: general formulations and properties","volume":"18","author":"Mitten","year":"1970","journal-title":"Oper. Res."},{"key":"10.1016\/S0004-3702(83)80009-5_bib17_2","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1287\/opre.19.2.550","article-title":"Branch and bound methods: general formulations and properties","volume":"19","author":"Mitten","year":"1971","journal-title":"Oper. Res."},{"key":"10.1016\/S0004-3702(83)80009-5_bib18","article-title":"A general paradigm for AI search algorithms","author":"Nau","year":"1982","journal-title":"Proc. of AAAI-82, Pittsburgh, PA"},{"key":"10.1016\/S0004-3702(83)80009-5_bib19","article-title":"General branch-and-bound and its relation to A* and AO*","author":"Nau","year":"1983","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(83)80009-5_bib20","series-title":"Information Processing-68","article-title":"Searching problem solving and game playing trees for minimum cost solutions","author":"Nilsson","year":"1968"},{"key":"10.1016\/S0004-3702(83)80009-5_bib21","author":"Nilsson","year":"1971"},{"key":"10.1016\/S0004-3702(83)80009-5_bib22","author":"Nilsson","year":"1980"},{"key":"10.1016\/S0004-3702(83)80009-5_bib23","series-title":"Proc. Sixth Annual Princeton Conf. Information Science and Systems","first-page":"370","article-title":"Is heuristic search really branch and bound?","author":"Pohl","year":"1972"},{"key":"10.1016\/S0004-3702(83)80009-5_bib24","author":"Reingold","year":"1977"},{"issue":"1,2","key":"10.1016\/S0004-3702(83)80009-5_bib25","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/S0004-3702(83)80010-1","article-title":"A minimax algorithm better than alpha-beta? yes and no","volume":"21","author":"Roizen","year":"1983","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(83)80009-5_bib26","series-title":"Theoretical Approaches to Non-Numerical Problem Solving","article-title":"Heuristic search program","author":"Slagle","year":"1970"},{"key":"10.1016\/S0004-3702(83)80009-5_bib27","article-title":"A problem-reduction approach to the linguistic analysis of waveforms","author":"Stockman","year":"1977"},{"key":"10.1016\/S0004-3702(83)80009-5_bib28","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0004-3702(79)90016-X","article-title":"A minimax algorithm better than alpha-beta?","volume":"12","author":"Stockman","year":"1979","journal-title":"Artificial Intelligence"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370283800095?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370283800095?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,7]],"date-time":"2019-02-07T12:41:05Z","timestamp":1549543265000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370283800095"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,3]]},"references-count":30,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1983,3]]}},"alternative-id":["S0004370283800095"],"URL":"https:\/\/doi.org\/10.1016\/s0004-3702(83)80009-5","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1983,3]]}}}