{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T13:57:36Z","timestamp":1768399056836,"version":"3.49.0"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,3,15]],"date-time":"2013-03-15T00:00:00Z","timestamp":1363305600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2013,9]]},"DOI":"10.1007\/s10589-013-9551-x","type":"journal-article","created":{"date-parts":[[2013,3,14]],"date-time":"2013-03-14T17:46:56Z","timestamp":1363283216000},"page":"97-111","source":"Crossref","is-referenced-by-count":29,"title":["Algorithmic improvements on dynamic programming for the bi-objective {0,1} knapsack problem"],"prefix":"10.1007","volume":"56","author":[{"given":"Jos\u00e9 Rui","family":"Figueira","sequence":"first","affiliation":[]},{"given":"Lu\u00eds","family":"Paquete","sequence":"additional","affiliation":[]},{"given":"Marco","family":"Sim\u00f5es","sequence":"additional","affiliation":[]},{"given":"Daniel","family":"Vanderpooten","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,3,15]]},"reference":[{"issue":"1","key":"9551_CR1","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1287\/mnsc.25.1.73","volume":"25","author":"Y. Aneja","year":"1979","unstructured":"Aneja, Y., Nair, K.: Bicriteria transportation problem. Manag. Sci. 25(1), 73\u201378 (1979)","journal-title":"Manag. Sci."},{"issue":"1","key":"9551_CR2","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/j.ejor.2008.07.047","volume":"198","author":"C. Bazgan","year":"2009","unstructured":"Bazgan, C., Hugot, H., Vanderpooten, D.: Implementing an efficient fptas for the 0-1 multi-objective knapsack problem. Eur. J. Oper. Res. 198(1), 47\u201356 (2009)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"9551_CR3","doi-asserted-by":"crossref","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. Comput. Oper. Res. 36(1), 260\u2013279 (2009)","journal-title":"Comput. Oper. Res."},{"issue":"12","key":"9551_CR4","doi-asserted-by":"crossref","first-page":"1865","DOI":"10.1016\/S0305-0548(02)00112-0","volume":"30","author":"M. Captivo","year":"2003","unstructured":"Captivo, M., Cl\u00edmaco, J., Figueira, J., Martins, E., dos Santos, J.: Solving bicriteria 0-1 knapsack problems using a labeling algorithm. Comput. Oper. Res. 30(12), 1865\u20131886 (2003)","journal-title":"Comput. Oper. Res."},{"key":"9551_CR5","volume-title":"Introduction to Algorithms","author":"T. Cormen","year":"2001","unstructured":"Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms. MIT Press, Cambridge (2001)"},{"issue":"12","key":"9551_CR6","doi-asserted-by":"crossref","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 multi-objective knapsack problems. Manag. Sci. 48(12), 1603\u20131612 (2002)","journal-title":"Manag. Sci."},{"issue":"2","key":"9551_CR7","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1016\/j.ejor.2004.08.005","volume":"169","author":"C. Gomes da Silva","year":"2006","unstructured":"Gomes da Silva, C., Cl\u00edmaco, J., Figueira, J.: A scatter search method for bi-criteria {0,1}-knapsack problems. Eur. J. Oper. Res. 169(2), 373\u2013391 (2006)","journal-title":"Eur. J. Oper. Res."},{"issue":"7","key":"9551_CR8","doi-asserted-by":"crossref","first-page":"2292","DOI":"10.1016\/j.cor.2006.11.001","volume":"35","author":"C. Gomes da Silva","year":"2008","unstructured":"Gomes da Silva, C., Cl\u00edmaco, J., Figueira, J.: Core problems in bi-criteria {0, 1}-knapsack problems. Comput. Oper. Res. 35(7), 2292\u20132306 (2008)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"9551_CR9","doi-asserted-by":"crossref","first-page":"1656","DOI":"10.1016\/j.ejor.2005.10.013","volume":"177","author":"C. Gomes da Silva","year":"2007","unstructured":"Gomes da Silva, C., Figueira, J., Cl\u00edmaco, J.: Integrating partial optimization with scatter search for solving bi-criteria {0, 1}-knapsack problems. Eur. J. Oper. Res. 177(3), 1656\u20131677 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"9551_CR10","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/S0377-2217(02)00080-2","volume":"140","author":"L. Jenkins","year":"2002","unstructured":"Jenkins, L.: A bicriteria knapsack program for planning remediation of contaminated lightstation sites. Eur. J. Oper. Res. 140(2), 427\u2013433 (2002)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"9551_CR11","doi-asserted-by":"crossref","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.M.: Dynamic programming approaches to the multiple criteria knapsack problem. Nav. Res. Logist. 47(1), 57\u201376 (2000)","journal-title":"Nav. Res. Logist."},{"key":"9551_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack Problems","author":"H. Kellerer","year":"2004","unstructured":"Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Berlin (2004)"},{"issue":"4\u20135","key":"9551_CR13","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/S0898-1221(99)00065-6","volume":"37","author":"M. Kostreva","year":"1999","unstructured":"Kostreva, M., Ogryczak, W., Tonkyn, D.: Relocation problems arising in conservation biology. Comput. Math. Appl. 37(4\u20135), 135\u2013150 (1999)","journal-title":"Comput. Math. Appl."},{"issue":"9","key":"9551_CR14","doi-asserted-by":"crossref","first-page":"2674","DOI":"10.1016\/j.cor.2005.10.003","volume":"34","author":"M. Ehrgott","year":"2007","unstructured":"Ehrgott, M., Gandibleux, X.: Bound sets for biobjective combinatorial optimization problems. Comput. Oper. Res. 34(9), 2674\u20132694 (2007)","journal-title":"Comput. Oper. Res."},{"key":"9551_CR15","volume-title":"Knapsack Problems\u2014Algorithms and Computer Implementations","author":"S. Martello","year":"1990","unstructured":"Martello, S., Toth, P.: Knapsack Problems\u2014Algorithms and Computer Implementations. Wiley, New York (1990)"},{"issue":"9","key":"9551_CR16","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1287\/mnsc.15.9.494","volume":"15","author":"G. Nemhauser","year":"1969","unstructured":"Nemhauser, G., Ullmann, Z.: Discrete dynamic programming and capital allocation. Manag. Sci. 15(9), 494\u2013505 (1969)","journal-title":"Manag. Sci."},{"key":"9551_CR17","doi-asserted-by":"crossref","first-page":"758","DOI":"10.1287\/opre.45.5.758","volume":"45","author":"D. Pisinger","year":"1997","unstructured":"Pisinger, D.: A minimal algorithm for the 0-1 knapsack problem. Oper. Res. 45, 758\u2013767 (1997)","journal-title":"Oper. Res."},{"issue":"3","key":"9551_CR18","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1287\/opre.37.3.384","volume":"37","author":"M. Rosenblatt","year":"1989","unstructured":"Rosenblatt, M., Sinuany-Stern, Z.: Generating the discrete efficient fronteir to the capital budgeting problem. Oper. Res. 37(3), 384\u2013394 (1989)","journal-title":"Oper. Res."},{"key":"9551_CR19","volume-title":"Multiple Criteria Optimization: Theory, Computation and Application","author":"R. Steuer","year":"1986","unstructured":"Steuer, R.: Multiple Criteria Optimization: Theory, Computation and Application. Wiley, New York (1986)"},{"issue":"4","key":"9551_CR20","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0191-2615(95)00032-1","volume":"30","author":"J. Teng","year":"1996","unstructured":"Teng, J., Tzeng, G.: A multiobjective programming approach for selecting non-independent transportation investiment alternatives. Transp. Res., Part B, Methodol. 30(4), 201\u2013307 (1996)","journal-title":"Transp. Res., Part B, Methodol."},{"issue":"2","key":"9551_CR21","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1023\/A:1008258310679","volume":"12","author":"M. Vis\u00e9e","year":"1998","unstructured":"Vis\u00e9e, M., Teghem, J., Pirlot, M., Ulungu, E.L.: Two-phases method and branch and bound procedures to solve the bi\u2013objective knapsack problem. J. Glob. Optim. 12(2), 139\u2013155 (1998)","journal-title":"J. Glob. Optim."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-013-9551-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-013-9551-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-013-9551-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T18:37:34Z","timestamp":1559241454000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-013-9551-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,15]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,9]]}},"alternative-id":["9551"],"URL":"https:\/\/doi.org\/10.1007\/s10589-013-9551-x","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,3,15]]}}}