{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T04:05:54Z","timestamp":1751861154156},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424239"},{"type":"electronic","value":"9783540446347"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44634-6_20","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T06:20:48Z","timestamp":1186726848000},"page":"210-221","source":"Crossref","is-referenced-by-count":17,"title":["Approximating Multi-objective Knapsack Problems"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Erlebach","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans","family":"Kellerer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ulrich","family":"Pferschy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,8,2]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"M. Ehrgott, Multicriteria Optimization, Lecture Notes in Economics and Mathematical Systems 491, Springer, 2000.","DOI":"10.1007\/978-3-662-22199-0"},{"key":"20_CR2","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/0377-2217(84)90053-5","volume":"15","author":"A. Frieze","year":"1984","unstructured":"A. Frieze and M. Clarke, \u201cApproximation algorithms for the m-dimensional 0\u20131 knapsack problem: Worst-case and probabilistic analyses\u201d, European Journal of Operational Research 15 (1984), 100\u2013109.","journal-title":"European Journal of Operational Research"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"B. Korte and R. Schrader, \u201cOn the Existence of Fast Approximation Schemes\u201d, Nonlinear Programming 4 O.L. Mangasarian, R.R. Meyer, S.M. Robinson (ed.), Academic Press 1981, 415\u2013437.","DOI":"10.1016\/B978-0-12-468662-5.50020-3"},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1023\/A:1009813105532","volume":"3","author":"H. Kellerer","year":"1999","unstructured":"H. Kellerer and U. Pferschy, \u201cA new fully polynomial time approximation scheme for the knapsack problem\u201d, Journal of Combinatorial Optimization 3 (1999), 59\u201371.","journal-title":"Journal of Combinatorial Optimization"},{"key":"20_CR5","unstructured":"H. Kellerer and U. Pferschy, \u201cImproved dynamic programming in connection with an FPTAS for the knapsack problem\u201d, Technical Report 05\/1999, Faculty of Economics, University of Graz, 1999, submitted."},{"key":"20_CR6","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":"K. Klamroth and M.M. Wiecek, \u201cDynamic programming approaches to the multiple criteria knapsack problem\u201d, Naval Research Logistics 47 (2000), 57\u201376.","journal-title":"Naval Research Logistics"},{"key":"20_CR7","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0377-2217(81)90175-2","volume":"8","author":"M.J. Magazine","year":"1981","unstructured":"M.J. Magazine and O. Oguz, \u201cA fully polynomial approximation algorithm for the 0\u20131 knapsack problem\u201d, European Journal of Operational Research 8 (1981), 270\u2013273.","journal-title":"European Journal of Operational Research"},{"key":"20_CR8","unstructured":"S. Martello and P. Toth, Knapsack Problems, J. Wiley & Sons, 1990."},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"C.H. Papadimitriou and M. Yannakakis, \u201cOn the approximability of trade-offs and optimal access of web sources\u201d. In Proceedings of the 41st Annual Symposium on Foundations of Computer Science FOCS\u201900 (2000), 86\u201392.","DOI":"10.1109\/SFCS.2000.892068"},{"key":"20_CR10","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/s006070050042","volume":"63","author":"U. Pferschy","year":"1999","unstructured":"U. Pferschy, \u201cDynamic programming revisited: Improving knapsack algorithms\u201d, Computing 63 (1999), 419\u2013430.","journal-title":"Computing"},{"key":"20_CR11","unstructured":"H.M. Safer and J.B. Orlin, \u201cFast approximation schemes for multi-criteria combinatorial optimization\u201d, Working Paper 3756-95, MIT, January 1995."},{"key":"20_CR12","unstructured":"H.M. Safer and J.B. Orlin, \u201cFast approximation schemes for multi-criteria flow, knapsack, and scheduling problems\u201d, Working Paper 3757-95, MIT, January 1995."},{"key":"20_CR13","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E. Zitzler","year":"1999","unstructured":"E. Zitzler and L. Thiele, \u201cMultiobjective Evolutionary Algorithms: A Comparative Case Study and the Strength Pareto Approach\u201d, IEEE Transactions on Evolutionary Computation 3 (1999), 257\u2013271.","journal-title":"IEEE Transactions on Evolutionary Computation"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44634-6_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T18:12:05Z","timestamp":1556734325000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44634-6_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424239","9783540446347"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-44634-6_20","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}