{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:37Z","timestamp":1725558997582},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540262244"},{"type":"electronic","value":"9783540324409"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11496199_47","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T10:29:15Z","timestamp":1279103355000},"page":"440-449","source":"Crossref","is-referenced-by-count":1,"title":["A Schedule Algebra Based Approach to Determine the K-Best Solutions of a Knapsack Problem with a Single Constraint"],"prefix":"10.1007","author":[{"given":"Subhash C.","family":"Sarin","sequence":"first","affiliation":[]},{"given":"Yuqiang","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Dae B.","family":"Chang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"5","key":"47_CR1","doi-asserted-by":"publisher","first-page":"1130","DOI":"10.1287\/opre.28.5.1130","volume":"28","author":"E. Balas","year":"1980","unstructured":"Balas, E., Zemel, E.: An Algorithm for Large Zero-One Knapsack Problem. Operations Research\u00a028(5), 1130\u20131154 (1980)","journal-title":"Operations Research"},{"issue":"3","key":"47_CR2","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1016\/S0377-2217(01)00179-5","volume":"138","author":"K.M. Bretthauer","year":"2002","unstructured":"Bretthauer, K.M., Shetty, B.: The nonlinear knapsack problem - algorithms and applications. European Journal of Operational Research\u00a0138(3), 459\u2013472 (2002)","journal-title":"European Journal of Operational Research"},{"key":"47_CR3","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1137\/S0097539795290477","volume":"28","author":"D. Eppstein","year":"1998","unstructured":"Eppstein, D.: Finding the k shortest paths. SIAM Journal of Computing\u00a028, 652\u2013673 (1998)","journal-title":"SIAM Journal of Computing"},{"key":"47_CR4","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1002\/nav.3800150210","volume":"15","author":"B. Giffler","year":"1968","unstructured":"Giffler, B.: Schedule Algebra: A Progress Report. Naval Research Logistics Quarterly\u00a015, 255\u2013280 (1968)","journal-title":"Naval Research Logistics Quarterly"},{"issue":"4","key":"47_CR5","first-page":"274","volume":"36","author":"E. Lin","year":"1998","unstructured":"Lin, E.: A bibliographical survey on some well-known non-standard knapsack problems. INFOR\u00a036(4), 274\u2013317 (1998)","journal-title":"INFOR"},{"issue":"1","key":"47_CR6","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1002\/nav.3800220110","volume":"22","author":"H.M. Salkin","year":"1975","unstructured":"Salkin, H.M., Kluyver, C.: Knapsack problem \u2013 Survey. Naval Research Logistics\u00a022(1), 127\u2013144 (1975)","journal-title":"Naval Research Logistics"},{"issue":"1","key":"47_CR7","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1080\/05695558308974611","volume":"15","author":"S.C. Sarin","year":"1983","unstructured":"Sarin, S.C.: Mixed Disc Packing Problem: Part I. IIE Transactions\u00a015(1), 37\u201345 (1983)","journal-title":"IIE Transactions"},{"issue":"2","key":"47_CR8","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1080\/05695558308974618","volume":"15","author":"S.C. Sarin","year":"1983","unstructured":"Sarin, S.C., Ahn, S.: Mixed Disc Packing Problem: Part II. IIE Transactions\u00a015(2), 91\u201398 (1983)","journal-title":"IIE Transactions"},{"issue":"1","key":"47_CR9","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1287\/opre.16.1.103","volume":"16","author":"J.F. Shapiro","year":"1968","unstructured":"Shapiro, J.F.: Dynamic Programming Algorithm for Integer Programming Problem I: The Integer Programming Problem Viewed as a Knapsack Type Problem. Operations Research\u00a016(1), 103\u2013121 (1968)","journal-title":"Operations Research"},{"key":"47_CR10","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1002\/net.3230060303","volume":"6","author":"D.R. Shier","year":"1976","unstructured":"Shier, D.R.: Interactive Methods for Determining the K Shortest Paths in a Network. Networks\u00a06, 205\u2013229 (1976)","journal-title":"Networks"},{"key":"47_CR11","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1002\/net.3230060403","volume":"6","author":"A. Wongseelashote","year":"1976","unstructured":"Wongseelashote, A.: An Algebra for Determining all Path-Values in a Network with Application to K-Shortest-Paths Problems. Networks\u00a06, 307\u2013334 (1976)","journal-title":"Networks"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Applications in Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11496199_47.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:40:01Z","timestamp":1619505601000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11496199_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540262244","9783540324409"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11496199_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}