{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:17:46Z","timestamp":1761895066770},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642131929"},{"type":"electronic","value":"9783642131936"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13193-6_22","type":"book-chapter","created":{"date-parts":[[2010,4,27]],"date-time":"2010-04-27T07:54:59Z","timestamp":1272354899000},"page":"253-265","source":"Crossref","is-referenced-by-count":12,"title":["Using Bound Sets in Multiobjective Optimization: Application to the Biobjective Binary Knapsack Problem"],"prefix":"10.1007","author":[{"given":"Charles","family":"Delort","sequence":"first","affiliation":[]},{"given":"Olivier","family":"Spanjaard","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1287\/mnsc.25.1.73","volume":"25","author":"Y.R. Aneja","year":"1979","unstructured":"Aneja, Y.R., Nair, K.P.K.: Bicriteria transportation problem. Management Science\u00a025, 73\u201378 (1979)","journal-title":"Management Science"},{"key":"22_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1007\/978-3-540-72845-0_31","volume-title":"Experimental Algorithms","author":"C. Bazgan","year":"2007","unstructured":"Bazgan, C., Hugot, H., Vanderpooten, D.: An efficient implementation for the 0-1 multi-objective knapsack problem. In: Demetrescu, C. (ed.) WEA 2007. LNCS, vol.\u00a04525, pp. 406\u2013419. Springer, Heidelberg (2007)"},{"issue":"1","key":"22_CR3","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\u2013279 (2009)","journal-title":"Computers & Operations Research"},{"key":"22_CR4","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1002\/nav.3800290202","volume":"29","author":"G. Bitran","year":"1982","unstructured":"Bitran, G., Rivera, J.M.: A combined approach to solve binary multicriteria problems. Naval Research Logistics Quarterly\u00a029, 181\u2013201 (1982)","journal-title":"Naval Research Logistics Quarterly"},{"issue":"12","key":"22_CR5","doi-asserted-by":"publisher","first-page":"1865","DOI":"10.1016\/S0305-0548(02)00112-0","volume":"30","author":"M.E. Captivo","year":"2003","unstructured":"Captivo, M.E., Cl\u00ecmaco, J., Figueira, J., Martins, E., Santos, J.L.: Solving bicriteria 0-1 knapsack problems using a labeling algorithm. Computers & Operations Research\u00a030(12), 1865\u20131886 (2003)","journal-title":"Computers & Operations Research"},{"key":"22_CR6","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1057\/jors.1980.114","volume":"31","author":"H.G. Daellenbach","year":"1980","unstructured":"Daellenbach, H.G., De Kluyver, C.A.: Note on multiple objective dynamic programming. Journal of the Operational Research Society\u00a031, 591\u2013594 (1980)","journal-title":"Journal of the Operational Research Society"},{"key":"22_CR7","volume-title":"Multicriteria Optimization","author":"M. Ehrgott","year":"2005","unstructured":"Ehrgott, M.: Multicriteria Optimization, 2nd edn. Springer, Heidelberg (2005)","edition":"2"},{"issue":"1","key":"22_CR8","first-page":"1","volume":"12","author":"M. Ehrgott","year":"2004","unstructured":"Ehrgott, M., Gandibleux, X.: Approximative solution methods for multiobjective combinatorial optimization. Journal of the Spanish Statistical and Operations Research Society\u00a012(1), 1\u201388 (2004)","journal-title":"Journal of the Spanish Statistical and Operations Research Society"},{"issue":"9","key":"22_CR9","doi-asserted-by":"publisher","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. Computers & Operations Research\u00a034(9), 2674\u20132694 (2007)","journal-title":"Computers & Operations Research"},{"key":"22_CR10","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":"12","key":"22_CR11","doi-asserted-by":"publisher","first-page":"1444","DOI":"10.1287\/mnsc.29.12.1444","volume":"29","author":"G. Kiziltan","year":"1983","unstructured":"Kiziltan, G., Yucaoglu, E.: An algorithm for multiobjective zero-one linear programming. Management Science\u00a029(12), 1444\u20131453 (1983)","journal-title":"Management Science"},{"key":"22_CR12","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.M.: Dynamic programming approaches to the multiple criteria knapsack problem. Naval Research Logistics\u00a047, 57\u201376 (2000)","journal-title":"Naval Research Logistics"},{"key":"22_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/3-540-61310-2_29","volume-title":"Integer Programming and Combinatorial Optimization","author":"P.D. Martin","year":"1996","unstructured":"Martin, P.D., Shmoys, D.B.: A new approach to computing optimal schedules for the job shop scheduling problem. In: Cunningham, W.H., Queyranne, M., McCormick, S.T. (eds.) IPCO 1996. LNCS, vol.\u00a01084, pp. 389\u2013403. Springer, Heidelberg (1996)"},{"key":"22_CR14","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1016\/S0377-2217(97)00077-5","volume":"107","author":"G. Mavrotas","year":"1998","unstructured":"Mavrotas, G., Diakoulaki, D.: A branch and bound algorithm for mixed zero-one multiple objective linear programming. European Journal of Operational Research\u00a0107, 530\u2013541 (1998)","journal-title":"European Journal of Operational Research"},{"key":"22_CR15","doi-asserted-by":"publisher","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. Operations Research\u00a045, 758\u2013767 (1997)","journal-title":"Operations Research"},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"Serafini, P.: Some considerations about computational complexity for multiobjective combinatorial problems. In: Recent advances and historical development of vector optimization. LNEMS, vol.\u00a0294 (1986)","DOI":"10.1007\/978-3-642-46618-2_15"},{"issue":"3","key":"22_CR17","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 multi-objective branch-and-bound framework. Application to the bi-objective spanning tree problem. INFORMS Journal of Computing\u00a020(3), 472\u2013484 (2008)","journal-title":"INFORMS Journal of Computing"},{"issue":"2","key":"22_CR18","first-page":"149","volume":"20","author":"B. Ulungu","year":"1995","unstructured":"Ulungu, B., Teghem, J.: The two-phase method: An efficient procedure to solve bi-objective combinatorial optimization problems. Foundations of Computing and Decision Sciences\u00a020(2), 149\u2013165 (1995)","journal-title":"Foundations of Computing and Decision Sciences"},{"key":"22_CR19","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/BF01584241","volume":"21","author":"B. Villareal","year":"1981","unstructured":"Villareal, B., Karwan, M.H.: Multicriteria integer programming: A (hybrid) dynamic programming recursive approach. Mathematical Programming\u00a021, 204\u2013223 (1981)","journal-title":"Mathematical Programming"},{"issue":"2","key":"22_CR20","doi-asserted-by":"publisher","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, B.: Two-phases method and branch and bound procedures to solve the bi\u2013objective knapsack problem. J. of Global Optimization\u00a012(2), 139\u2013155 (1998)","journal-title":"J. of Global Optimization"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13193-6_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T22:02:35Z","timestamp":1606168955000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13193-6_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642131929","9783642131936"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13193-6_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}