{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T09:20:35Z","timestamp":1760606435510},"reference-count":52,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,2,1]],"date-time":"2001-02-01T00:00:00Z","timestamp":980985600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,25]],"date-time":"2013-07-25T00:00:00Z","timestamp":1374710400000},"content-version":"vor","delay-in-days":4557,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[2001,2]]},"DOI":"10.1016\/s0004-3702(00)00066-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T16:57:34Z","timestamp":1027616254000},"page":"109-138","source":"Crossref","is-referenced-by-count":2,"title":["Iterative state-space reduction for flexible computation"],"prefix":"10.1016","volume":"126","author":[{"given":"Weixiong","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0004-3702(00)00066-7_ID003","series-title":"The Traveling Salesman Problem","first-page":"361","article-title":"Branch and bound methods","author":"Balas","year":"1985"},{"key":"10.1016\/S0004-3702(00)00066-7_ID004","series-title":"Encyclopedia of Artificial Intelligence","first-page":"1467","article-title":"Search, beam","author":"Bisiani","year":"1992"},{"key":"10.1016\/S0004-3702(00)00066-7_ID005","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0004-3702(94)90054-X","article-title":"Deliberation scheduling for problem solving in time-constrained environments","volume":"Vol. 67","author":"Boddy","year":"1994","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(00)00066-7_ID006","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1287\/mnsc.26.7.736","article-title":"Some new branching and bounding criteria for the asymmetric traveling salesman problem","volume":"Vol. 26","author":"Carpaneto","year":"1980","journal-title":"Management Science"},{"key":"10.1016\/S0004-3702(00)00066-7_ID007","series-title":"Proc. IJCAI-91, Sydney, Australia","first-page":"331","article-title":"Where the really hard problems are","author":"Cheeseman","year":"1991"},{"key":"10.1016\/S0004-3702(00)00066-7_ID008","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0004-3702(93)90036-B","article-title":"Approximating probabilistic inference in bayesian belief networks is NP-hard","volume":"Vol. 60","author":"Dagum","year":"1993","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(00)00066-7_ID009","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/321033.321034","article-title":"A computing procedure for quantification theory","volume":"Vol. 7","author":"Davis","year":"1960","journal-title":"J. ACM"},{"key":"10.1016\/S0004-3702(00)00066-7_ID010","series-title":"Proc. AAAI-88, St. Paul, MN","first-page":"49","article-title":"An analysis of time-dependent planning","author":"Dean","year":"1988"},{"key":"10.1016\/S0004-3702(00)00066-7_ID011","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0004-3702(81)90002-3","article-title":"Inductive learning of structural descriptions: Evaluation criteria and comparative review of selected methods","volume":"Vol. 16","author":"Dietterich","year":"1981","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(00)00066-7_ID012","series-title":"Constraint directed search: A case study of job-shop scheduling, Ph.D. Thesis","author":"Fox","year":"1983"},{"key":"10.1016\/S0004-3702(00)00066-7_ID013","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0004-3702(92)90004-H","article-title":"Partial constraint satisfaction","volume":"Vol. 58","author":"Freuder","year":"1992","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(00)00066-7_ID014","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0004-3702(00)00066-7_ID015","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/0004-3702(92)90059-7","article-title":"Iterative broadening","volume":"Vol. 55","author":"Ginsberg","year":"1992","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(00)00066-7_ID016","series-title":"Anytime heuristic search: First results","author":"Hansen","year":"1997"},{"key":"10.1016\/S0004-3702(00)00066-7_ID017","series-title":"The Theory of Branching Processes","author":"Harris","year":"1963"},{"key":"10.1016\/S0004-3702(00)00066-7_ID018","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1007\/BF01584070","article-title":"The traveling salesman problem and minimum spanning trees: Part II","volume":"Vol. 1","author":"Held","year":"1971","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0004-3702(00)00066-7_ID019","series-title":"Proceedings of the AAAI Fall Symposium on Flexible Computation in Intelligent Systems: Results, Issues and Opportunities, Cambridge, MA","year":"1996"},{"key":"10.1016\/S0004-3702(00)00066-7_ID020","series-title":"Proc. 3rd Workshop on Uncertainty in Artificial Intelligence","article-title":"Reasoning about beliefs and actions under computational resource constraints","author":"Horvitz","year":"1987"},{"key":"10.1016\/S0004-3702(00)00066-7_ID021","first-page":"177","article-title":"Using branch-and-bound algorithms to obtain suboptimal solutions","volume":"Vol. 27","author":"Ibaraki","year":"1983","journal-title":"Zeitschrift f\u00fcr Operations Research"},{"key":"10.1016\/S0004-3702(00)00066-7_ID022","series-title":"Proc. 7th Annual ACM-SIAM Symposium on Discrete Algorithms","first-page":"341","article-title":"Asymptotic experimental analysis for the Held\u2013Karp Traveling Salesman bound","author":"Johnson","year":"1996"},{"key":"10.1016\/S0004-3702(00)00066-7_ID023","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/S0004-3702(83)80006-X","article-title":"Searching for an optimal path in a tree with random costs","volume":"Vol. 21","author":"Karp","year":"1983","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(00)00066-7_ID024","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0004-3702(85)90084-0","article-title":"Depth-first iterative-deepening: An optimal admissible tree search","volume":"Vol. 27","author":"Korf","year":"1985","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(00)00066-7_ID025","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0004-3702(90)90054-4","article-title":"Real-time heuristic search","volume":"Vol. 42","author":"Korf","year":"1990","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(00)00066-7_ID026","series-title":"Proc. AAAI 1994 Workshop on Experimental Evaluation of Reasoning and Search Methods, Seattle, WA","article-title":"Incremental random search trees","author":"Korf","year":"1994"},{"key":"10.1016\/S0004-3702(00)00066-7_ID027","series-title":"Proc. 1st International Conference on AI Planning Systems, College Park, MD","first-page":"145","article-title":"Systematic and nonsystematic search strategies","author":"Langley","year":"1992"},{"key":"10.1016\/S0004-3702(00)00066-7_ID028","series-title":"The Traveling Salesman Problem","author":"Lawler","year":"1985"},{"key":"10.1016\/S0004-3702(00)00066-7_ID029","series-title":"Large-vocabulary speaker-dependent continuous recognition: The sphinx system, Ph.D. Thesis","author":"Lee","year":"1988"},{"key":"10.1016\/S0004-3702(00)00066-7_ID030","first-page":"259","article-title":"Linear assignment problems","volume":"Vol. 31","author":"Martello","year":"1987","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0004-3702(00)00066-7_ID031","series-title":"Disorder in Physical Systems","first-page":"249","article-title":"Probabilistic analysis of tree search","author":"McDiarmid","year":"1990"},{"key":"10.1016\/S0004-3702(00)00066-7_ID032","series-title":"Proc. IJCAI-91, Sydney, Australia","first-page":"172","article-title":"An expected-cost analysis of backtracking and non-backtracking algorithms","author":"McDiarmid","year":"1991"},{"key":"10.1016\/S0004-3702(00)00066-7_ID033","series-title":"Proc. AAAI-92, San Jose, CA","first-page":"459","article-title":"Hard and easy distributions of SAT problems","author":"Mitchell","year":"1992"},{"key":"10.1016\/S0004-3702(00)00066-7_ID034","series-title":"Lecture notes on approximation algorithms","author":"Motwani","year":"1992"},{"key":"10.1016\/S0004-3702(00)00066-7_ID035","series-title":"Generating space telescope observation schedules","author":"Muscettola","year":"1989"},{"key":"10.1016\/S0004-3702(00)00066-7_ID036","series-title":"Combinatorial Optimization: Algorithms and Complexity","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/S0004-3702(00)00066-7_ID037","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01543478","article-title":"An upper bound on the complexity of iterative-deepening-A\u2217","volume":"Vol. 5","author":"Patrick","year":"1992","journal-title":"Ann. Math. Artificial Intelligence"},{"key":"10.1016\/S0004-3702(00)00066-7_ID038","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0004-3702(95)00057-7","article-title":"Epsilon-transformation: Exploiting phase transitions to solve combinatorial optimization problems","volume":"Vol. 81","author":"Pemberton","year":"1996","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(00)00066-7_ID039","series-title":"Proceedings of the AAAI Fall Symposium on Rational Agency, Cambridge, MA","year":"1995"},{"key":"10.1016\/S0004-3702(00)00066-7_ID040","series-title":"Proceedings of the IJCAI-95 Workshop on Anytime Algorithms and Deliberation Scheduling, Montreal, Canada","year":"1995"},{"key":"10.1016\/S0004-3702(00)00066-7_ID041","series-title":"Proc. AAAI-93, Washington, DC","first-page":"769","article-title":"Iterative weakening: Optimal and near-optimal policies for the selection of search bias","author":"Provost","year":"1993"},{"key":"10.1016\/S0004-3702(00)00066-7_ID042","series-title":"The ARGOS image understanding system, Ph.D. Thesis","author":"Rubin","year":"1978"},{"key":"10.1016\/S0004-3702(00)00066-7_ID043","series-title":"Do the Right Thing: Studies in Limited Rationality","author":"Russell","year":"1991"},{"key":"10.1016\/S0004-3702(00)00066-7_ID044","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0377-2217(82)90015-7","article-title":"A branch and bound algorithm for the symmetric Traveling Salesman Problem based on the 1-tree relaxation","volume":"Vol. 9","author":"Volgenant","year":"1982","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0004-3702(00)00066-7_ID045","series-title":"Artificial Intelligence","author":"Winston","year":"1992"},{"key":"10.1016\/S0004-3702(00)00066-7_ID046","series-title":"Proc. AAAI 1993 Spring Symposium on AI and NP-Hard Problems, Stanford, CA","first-page":"160","article-title":"Truncated branch-and-bound: A case study on the asymmetric TSP","author":"Zhang","year":"1993"},{"key":"10.1016\/S0004-3702(00)00066-7_ID047","series-title":"Proc. AAAI-98, Madison, WI","first-page":"425","article-title":"Complete anytime beam search","author":"Zhang","year":"1998"},{"key":"10.1016\/S0004-3702(00)00066-7_ID048","series-title":"Proc. 14th Annual Conference on Uncertainty in Artificial Intelligence (UAI-98), Madison, WI","first-page":"531","article-title":"Flexible and approximate computation through state-space reduction","author":"Zhang","year":"1998"},{"key":"10.1016\/S0004-3702(00)00066-7_ID049","series-title":"Proc. AAAI 1999 Spring Symposium on Search Techniques for Problem Solving under Uncertainty and Incomplete Information, Stanford, CA","first-page":"148","article-title":"Truncated and anytime depth-first branch-and-bound: A case study on the asymmetric Traveling Salesman Problem","author":"Zhang","year":"1999"},{"key":"10.1016\/S0004-3702(00)00066-7_ID050","series-title":"Proc. AAAI-92, San Jose, CA","first-page":"545","article-title":"An average-case analysis of branch-and-bound with applications: Summary of results","author":"Zhang","year":"1992"},{"key":"10.1016\/S0004-3702(00)00066-7_ID051","series-title":"Proc. AAAI-93, Washington, DC","first-page":"769","article-title":"Depth-first vs. best-first search: New results","author":"Zhang","year":"1993"},{"key":"10.1016\/S0004-3702(00)00066-7_ID052","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0004-3702(94)00047-6","article-title":"Performance of linear-space search algorithms","volume":"Vol. 79","author":"Zhang","year":"1995","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(00)00066-7_ID053","series-title":"Proc. AAAI-94, Seattle, WA","first-page":"895","article-title":"Epsilon-transformation: Exploiting phase transitions to solve combinatorial optimization problems\u2014Initial results","author":"Zhang","year":"1994"},{"key":"10.1016\/S0004-3702(00)00066-7_ID054","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0004-3702(94)00074-3","article-title":"Optimal composition of real-time systems","volume":"Vol. 82","author":"Zilberstein","year":"1996","journal-title":"Artificial Intelligence"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370200000667?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370200000667?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T12:28:32Z","timestamp":1556195312000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370200000667"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,2]]},"references-count":52,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,2]]}},"alternative-id":["S0004370200000667"],"URL":"https:\/\/doi.org\/10.1016\/s0004-3702(00)00066-7","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[2001,2]]}}}