{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T14:26:00Z","timestamp":1768400760497,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642317699","type":"print"},{"value":"9783642317705","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31770-5_31","type":"book-chapter","created":{"date-parts":[[2012,7,26]],"date-time":"2012-07-26T05:03:12Z","timestamp":1343278992000},"page":"348-359","source":"Crossref","is-referenced-by-count":1,"title":["Dynamic Programming for a Biobjective Search Problem in a Line"],"prefix":"10.1007","author":[{"given":"Lu\u00eds","family":"Paquete","sequence":"first","affiliation":[]},{"given":"Mathias","family":"Jaschob","sequence":"additional","affiliation":[]},{"given":"Kathrin","family":"Klamroth","sequence":"additional","affiliation":[]},{"given":"Jochen","family":"Gorski","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"31_CR1","unstructured":"Ahuja, R., Magnanti, T., Orlin, J.: Network Flows: Theory, Algorithms and Applications. Prentice-Hall (1993)"},{"issue":"1","key":"31_CR2","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1016\/j.cor.2007.09.009","volume":"36","author":"C. Bazgan","year":"2009","unstructured":"Bazgan, C., Hugot, H., Vanderpooten, D.: Solving efficiently the 0-1 multi-objective knapsack problem. Computers & Operations Research\u00a036(1), 260\u2013276 (2009)","journal-title":"Computers & Operations Research"},{"key":"31_CR3","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1016\/0022-247X(65)90045-4","volume":"12","author":"T. Brown","year":"1965","unstructured":"Brown, T., Strauch, R.: Dynamic programming in multiplicative lattices. Journal of Mathematical Analysis and Applications\u00a012, 364\u2013370 (1965)","journal-title":"Journal of Mathematical Analysis and Applications"},{"key":"31_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-642-02011-7_13","volume-title":"Experimental Algorithms","author":"D. Delling","year":"2009","unstructured":"Delling, D., Wagner, D.: Pareto Paths with SHARC. In: Vahrenhold, J. (ed.) SEA 2009. LNCS, vol.\u00a05526, pp. 125\u2013136. Springer, Heidelberg (2009)"},{"key":"31_CR5","unstructured":"Ehrgott, M.: Multicriteria Optimization, 2nd edn. Springer (2005)"},{"key":"31_CR6","unstructured":"Gaver, D., Jacobs, P., Pilnick, S.: On minefield transit by detection, avoidance and demining. In: Bottoms, A., Scandrett, C. (eds.) Applications of Technology to Demining, an Anthology of Scientific Papers 1995-2005, Part 3 \u2013 Naval Mine Countermeasures, Society for Countermine Technology (2005)"},{"key":"31_CR7","doi-asserted-by":"crossref","unstructured":"Hansen, P.: Bicriterion path problems. In: Fandel, G., Gal, T. (eds.) Multiple Criteria Decision Making, Theory and Application. Lecture Notes in Economics and Mathematical Systems, vol.\u00a0177, pp. 109\u2013127. Springer (1980)","DOI":"10.1007\/978-3-642-48782-8_9"},{"key":"31_CR8","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1137\/0321030","volume":"21","author":"M. Henig","year":"1983","unstructured":"Henig, M.: Vector-value dynamic programming. SIAM Journal on Control and Optimization\u00a021, 490\u2013499 (1983)","journal-title":"SIAM Journal on Control and Optimization"},{"key":"31_CR9","doi-asserted-by":"crossref","unstructured":"Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer (2004)","DOI":"10.1007\/978-3-540-24777-7"},{"issue":"1","key":"31_CR10","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1002\/(SICI)1520-6750(200002)47:1<57::AID-NAV4>3.0.CO;2-4","volume":"47","author":"K. Klamroth","year":"2000","unstructured":"Klamroth, K., Wiecek, M.: Dynamic programming approaches to the multiple criteria knapsack problem. Naval Research Logistics\u00a047(1), 57\u201376 (2000)","journal-title":"Naval Research Logistics"},{"key":"31_CR11","doi-asserted-by":"crossref","unstructured":"Sodhi, M., Swaszek, P., Bovio, E.: Stochastic line search using UUVs. In: 9th International Conference on Information Fusion (ICIF 2006), pp. 1\u20135 (2006)","DOI":"10.1109\/ICIF.2006.301784"},{"issue":"4","key":"31_CR12","first-page":"22","volume":"38","author":"L. Stone","year":"2011","unstructured":"Stone, L.: In search of AF flight 447. ORMS Today\u00a038(4), 22\u201331 (2011)","journal-title":"ORMS Today"},{"key":"31_CR13","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/BF01584241","volume":"21","author":"B. Villarreal","year":"1981","unstructured":"Villarreal, B., Karwan, M.: Multicriteria integer programming: A (hybrid) dynamic programming recursive approach. Mathematical Programming\u00a021, 204\u2013223 (1981)","journal-title":"Mathematical Programming"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31770-5_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:47:49Z","timestamp":1620128869000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31770-5_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642317699","9783642317705"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31770-5_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}