{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,23]],"date-time":"2025-04-23T00:10:09Z","timestamp":1745367009437,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642351006"},{"type":"electronic","value":"9783642351013"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-35101-3_20","type":"book-chapter","created":{"date-parts":[[2012,11,29]],"date-time":"2012-11-29T16:40:16Z","timestamp":1354207216000},"page":"230-241","source":"Crossref","is-referenced-by-count":1,"title":["Anytime Algorithms for Biobjective Heuristic Search"],"prefix":"10.1007","author":[{"given":"Priyankar","family":"Ghosh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Partha Pratim","family":"Chakrabarti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pallab","family":"Dasgupta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-3636-9","volume-title":"High-level synthesis: introduction to chip and system design","author":"D. Gajski","year":"1992","unstructured":"Gajski, D., Dutt, N., Wu, A., Lin, S.: High-level synthesis: introduction to chip and system design. Kluwer Academic Publishers, Norwell (1992)"},{"doi-asserted-by":"crossref","unstructured":"Elton, E.J., Gruber, M.J., Blake, C.R.: Modern portfolio theory, 1950 to date. SSRN eLibrary (1997)","key":"20_CR2","DOI":"10.1016\/S0378-4266(97)00048-4"},{"unstructured":"Mishkin, F.S.: The Economics of Money, Banking, and Financial Markets, 7th edn. Addison-Wesley (2004)","key":"20_CR3"},{"issue":"1","key":"20_CR4","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/s10479-006-0072-1","volume":"147","author":"M. M\u00fcller-Hannemann","year":"2006","unstructured":"M\u00fcller-Hannemann, M., Weihe, K.: On the cardinality of the Pareto set in bicriteria shortest path problems. Annals OR\u00a0147(1), 269\u2013286 (2006)","journal-title":"Annals OR"},{"issue":"4","key":"20_CR5","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1287\/opre.1040.0197","volume":"53","author":"O. Jahn","year":"2005","unstructured":"Jahn, O., M\u00f6hring, R.H., Schulz, A.S., Stier-Moses, N.E.: System-optimal routing of traffic flows with user constraints in networks with congestion. Operations Research\u00a053(4), 600\u2013616 (2005)","journal-title":"Operations Research"},{"unstructured":"Nilsson, N.J.: Principle of artificial intelligence. Tioga Publishing Co. (1980)","key":"20_CR6"},{"key":"20_CR7","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1145\/115234.115368","volume":"38","author":"B.S. Stewart","year":"1991","unstructured":"Stewart, B.S., White III, C.C.: Multiobjective A*. J. ACM\u00a038, 775\u2013814 (1991)","journal-title":"J. ACM"},{"issue":"2","key":"20_CR8","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1006\/jagm.1996.0015","volume":"20","author":"P. Dasgupta","year":"1996","unstructured":"Dasgupta, P., Chakrabarti, P.P., DeSarkar, S.C.: Multiobjective heuristic search in AND\/OR graphs. Journal of Algorithms\u00a020(2), 282\u2013311 (1996)","journal-title":"Journal of Algorithms"},{"issue":"5","key":"20_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1754399.1754400","volume":"57","author":"L. Mandow","year":"2010","unstructured":"Mandow, L., P\u00e9rez-de-la-Cruz, J.L.: Multiobjective A* search with consistent heuristics. J. ACM\u00a057(5), 27:1\u201327:25 (2010)","journal-title":"J. ACM"},{"unstructured":"Zhou, R., Hansen, E.A.: Beam-stack search: Integrating backtracking with beam search. In: ICAPS, pp. 90\u201398 (2005)","key":"20_CR10"},{"unstructured":"Furcy, D., Koenig, S.: Limited discrepancy beam search. In: IJCAI, pp. 125\u2013131 (2005)","key":"20_CR11"},{"unstructured":"Likhachev, M., Gordon, G.J., Thrun, S.: ARA*: Anytime A* with provable bounds on sub-optimality. In: NIPS (2003)","key":"20_CR12"},{"doi-asserted-by":"crossref","unstructured":"R\u00f6ger, G., Helmert, M.: The more, the merrier: Combining heuristic estimators for satisficing planning. In: ICAPS, pp. 246\u2013249 (2010)","key":"20_CR13","DOI":"10.1609\/icaps.v20i1.13435"},{"doi-asserted-by":"crossref","unstructured":"Valenzano, R.A., Sturtevant, N.R., Schaeffer, J., Buro, K., Kishimoto, A.: Simultaneously searching with multiple settings: An alternative to parameter tuning for suboptimal single-agent search algorithms. In: ICAPS, pp. 177\u2013184 (2010)","key":"20_CR14","DOI":"10.1609\/icaps.v20i1.13423"},{"issue":"3","key":"20_CR15","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* - a memory-bounded anytime heuristic-search algorithm. IEEE Transactions on Systems, Man, and Cybernetics, Part B\u00a041(3), 725\u2013735 (2011)","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics, Part B"},{"doi-asserted-by":"crossref","unstructured":"Thayer, J.T., Ruml, W.: Anytime heuristic search: Frameworks and algorithms. In: The Third Annual Symposium on Combinatorial Search (2010)","key":"20_CR16","DOI":"10.1609\/socs.v1i1.18181"},{"issue":"14","key":"20_CR17","doi-asserted-by":"publisher","first-page":"1613","DOI":"10.1016\/j.artint.2007.11.009","volume":"172","author":"M. Likhachev","year":"2008","unstructured":"Likhachev, M., Ferguson, D., Gordon, G.J., Stentz, A., Thrun, S.: Anytime search in dynamic graphs. Artif. Intell.\u00a0172(14), 1613\u20131643 (2008)","journal-title":"Artif. Intell."},{"key":"20_CR18","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1613\/jair.2096","volume":"28","author":"E.A. Hansen","year":"2007","unstructured":"Hansen, E.A., Zhou, R.: Anytime heuristic search. J. Artif. Intell. Res. (JAIR)\u00a028, 267\u2013297 (2007)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"unstructured":"Aine, S., Chakrabarti, P.P., Kumar, R.: AWA* - a window constrained anytime heuristic search algorithm. In: IJCAI, pp. 2250\u20132255 (2007)","key":"20_CR19"},{"issue":"1","key":"20_CR20","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/s00224-007-9096-4","volume":"45","author":"G. Tsaggouris","year":"2009","unstructured":"Tsaggouris, G., Zaroliagis, C.D.: Multiobjective optimization: Improved FPTAS for shortest paths and non-linear objectives with applications. Theory Comput. Syst.\u00a045(1), 162\u2013186 (2009)","journal-title":"Theory Comput. Syst."},{"unstructured":"Perny, P., Spanjaard, O.: Near admissible algorithms for multiobjective search. In: ECAI, pp. 490\u2013494 (2008)","key":"20_CR21"},{"issue":"1-3","key":"20_CR22","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/S0304-3975(03)00288-3","volume":"306","author":"E. Angel","year":"2003","unstructured":"Angel, E., Bampis, E., Kononov, A.: On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems. Theor. Comput. Sci.\u00a0306(1-3), 319\u2013338 (2003)","journal-title":"Theor. Comput. Sci."},{"issue":"12","key":"20_CR23","doi-asserted-by":"publisher","first-page":"1603","DOI":"10.1287\/mnsc.48.12.1603.445","volume":"48","author":"T. Erlebach","year":"2002","unstructured":"Erlebach, T., Kellerer, H., Pferschy, U.: Approximating multiobjective knapsack problems. Manage. Sci.\u00a048(12), 1603\u20131612 (2002)","journal-title":"Manage. Sci."},{"doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H., Yannakakis, M.: On the approximability of trade-offs and optimal access of web sources. In: FOCS, pp. 86\u201392 (2000)","key":"20_CR24","DOI":"10.1109\/SFCS.2000.892068"},{"key":"20_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/3-540-36970-8_7","volume-title":"Evolutionary Multi-Criterion Optimization","author":"V. Barichard","year":"2003","unstructured":"Barichard, V., Hao, J.K.: A Population and Interval Constraint Propagation Algorithm. In: Fonseca, C.M., Fleming, P.J., Zitzler, E., Deb, K., Thiele, L. (eds.) EMO 2003. LNCS, vol.\u00a02632, pp. 88\u2013101. Springer, Heidelberg (2003)"},{"issue":"3","key":"20_CR26","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1287\/ijoc.1070.0260","volume":"20","author":"F. Sourd","year":"2008","unstructured":"Sourd, F., Spanjaard, O.: A multiobjective branch-and-bound framework: Application to the biobjective spanning tree problem. INFORMS Journal on Computing\u00a020(3), 472\u2013484 (2008)","journal-title":"INFORMS Journal on Computing"},{"key":"20_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88908-3","volume-title":"Multiobjective Optimization","author":"J. Branke","year":"2008","unstructured":"Branke, J., Deb, K., Miettinen, K., Slowinski, R.: Multiobjective Optimization. LNCS, vol.\u00a05252. Springer, Heidelberg (2008)"},{"issue":"2","key":"20_CR28","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K. Deb","year":"2002","unstructured":"Deb, K., Agrawal, S., Pratap, A., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evolutionary Computation\u00a06(2), 182\u2013197 (2002)","journal-title":"IEEE Trans. Evolutionary Computation"},{"issue":"1","key":"20_CR29","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0020-0190(91)90248-G","volume":"37","author":"U.K. Sarkar","year":"1991","unstructured":"Sarkar, U.K., Chakrabarti, P.P., Ghose, S., Sarkar, S.C.D.: Multiple stack branch and bound. Inf. Process. Lett.\u00a037(1), 43\u201348 (1991)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"20_CR30","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.ejor.2011.08.030","volume":"217","author":"E. Machuca","year":"2012","unstructured":"Machuca, E., Mandow, L., P\u00e9rez-de-la-Cruz, J.L., Ruiz-Sep\u00falveda, A.: A comparison of heuristic best-first algorithms for bicriterion shortest path problems. European Journal of Operational Research\u00a0217(1), 44\u201353 (2012)","journal-title":"European Journal of Operational Research"},{"unstructured":"Mandow, L., P\u00e9rez-de-la-Cruz, J.L.: A multiobjective frontier search algorithm. In: IJCAI, pp. 2340\u20132345 (2007)","key":"20_CR31"}],"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_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,22]],"date-time":"2025-04-22T23:35:18Z","timestamp":1745364918000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35101-3_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642351006","9783642351013"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35101-3_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}