{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T00:56:14Z","timestamp":1771030574571,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642351006","type":"print"},{"value":"9783642351013","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-35101-3_22","type":"book-chapter","created":{"date-parts":[[2012,11,29]],"date-time":"2012-11-29T16:40:16Z","timestamp":1354207216000},"page":"254-265","source":"Crossref","is-referenced-by-count":4,"title":["Anytime Column Search"],"prefix":"10.1007","author":[{"given":"Satya Gautam","family":"Vadlamudi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Piyush","family":"Gaurav","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sandip","family":"Aine","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Partha Pratim","family":"Chakrabarti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","unstructured":"Aine, S., Chakrabarti, P.P.: An analysis of breadth-first beam search using uniform cost trees. In: The Eleventh International Symposium on Artificial Intelligence and Mathematics (January 2010)"},{"key":"22_CR2","unstructured":"Aine, S., Chakrabarti, P.P., Kumar, R.: AWA* - A window constrained anytime heuristic search algorithm. In: Veloso, M.M. (ed.) IJCAI, pp. 2250\u20132255 (2007)"},{"issue":"4","key":"22_CR3","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1111\/j.1467-8640.2010.00364.x","volume":"26","author":"S. Aine","year":"2010","unstructured":"Aine, S., Chakrabarti, P.P., Kumar, R.: Heuristic search under contract. Computational Intelligence\u00a026(4), 386\u2013419 (2010)","journal-title":"Computational Intelligence"},{"key":"22_CR4","unstructured":"Bisiani, R.: Beam search. In: Encyclopedia of Articial Intelligence, pp. 56\u201358 (1987)"},{"issue":"2","key":"22_CR5","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0004-3702(89)90010-6","volume":"41","author":"P.P. Chakrabarti","year":"1989","unstructured":"Chakrabarti, P.P., Ghose, S., Acharya, A., Sarkar, S.C.D.: Heuristic search in restricted memory. Artificial Intelligence\u00a041(2), 197\u2013221 (1989)","journal-title":"Artificial Intelligence"},{"issue":"1","key":"22_CR6","first-page":"267","volume":"28","author":"E.A. Hansen","year":"2007","unstructured":"Hansen, E.A., Zhou, R.: Anytime heuristic search. J. Artif. Int. Res.\u00a028(1), 267\u2013297 (2007)","journal-title":"J. Artif. Int. Res."},{"key":"22_CR7","unstructured":"Hansen, E.A., Zilberstein, S., Danilchenko, V.A.: Anytime heuristic search: First results. Technical Report\u00a050, Univ. of Massachusetts (1997)"},{"issue":"2","key":"22_CR8","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"P.E. Hart","year":"1968","unstructured":"Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics\u00a04(2), 100\u2013107 (1968)","journal-title":"IEEE Transactions on Systems Science and Cybernetics"},{"issue":"1-2","key":"22_CR9","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/S0004-3702(01)00092-3","volume":"134","author":"R.E. Korf","year":"2002","unstructured":"Korf, R.E., Felner, A.: Disjoint pattern database heuristics. Artif. Intell.\u00a0134(1-2), 9\u201322 (2002)","journal-title":"Artif. Intell."},{"issue":"4","key":"22_CR10","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1287\/opre.14.4.699","volume":"14","author":"E.L. Lawler","year":"1966","unstructured":"Lawler, E.L., Wood, D.E.: Branch-and-bound methods: A survey. Operational Research\u00a014(4), 699\u2013719 (1966)","journal-title":"Operational Research"},{"key":"22_CR11","volume-title":"Advances in Neural Information Processing Systems","author":"M. Likhachev","year":"2004","unstructured":"Likhachev, M., Gordon, G.J., Thrun, S.: ARA*: Anytime A* with provable bounds on sub-optimality. In: Advances in Neural Information Processing Systems, vol.\u00a016. MIT Press, Cambridge (2004)"},{"key":"22_CR12","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G. Reinelt","year":"1991","unstructured":"Reinelt, G.: TSPLIB - A traveling salesman problem library. ORSA Journal on Computing\u00a03, 376\u2013384 (1991)","journal-title":"ORSA Journal on Computing"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"Thayer, J.T., Ruml, W.: Anytime heuristic search: Frameworks and algorithms. In: SOCS (2010)","DOI":"10.1609\/socs.v1i1.18181"},{"issue":"3","key":"22_CR14","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1109\/TSMCB.2010.2089619","volume":"41","author":"S.G. Vadlamudi","year":"2011","unstructured":"Vadlamudi, S.G., Aine, S., Chakrabarti, P.P.: MAWA*\u2014A memory-bounded anytime heuristic-search algorithm. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics\u00a041(3), 725\u2013735 (2011)","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics"},{"key":"22_CR15","doi-asserted-by":"crossref","unstructured":"van den Berg, J., Shah, R., Huang, A., Goldberg, K.Y.: Anytime nonparametric A*. In: AAAI (2011)","DOI":"10.1609\/aaai.v25i1.7819"},{"key":"22_CR16","unstructured":"Zhang, W.: Complete anytime beam search. In: Proceedings of 14th National Conference of Artificial Intelligence AAAI 1998, pp. 425\u2013430. AAAI Press (1998)"},{"key":"22_CR17","unstructured":"Zhou, R., Hansen, E.A.: Beam-stack search: Integrating backtracking with beam search. In: Proceedings of the 15th International Conference on Automated Planning and Scheduling (ICAPS 2005), Monterey, CA, pp. 90\u201398 (2005)"}],"container-title":["Lecture Notes in Computer Science","AI 2012: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35101-3_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,27]],"date-time":"2023-06-27T06:23:26Z","timestamp":1687847006000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35101-3_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642351006","9783642351013"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35101-3_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}