{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,2]],"date-time":"2024-06-02T16:49:37Z","timestamp":1717346977135},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,5,9]],"date-time":"2010-05-09T00:00:00Z","timestamp":1273363200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1007\/s10898-010-9552-6","type":"journal-article","created":{"date-parts":[[2010,5,8]],"date-time":"2010-05-08T14:17:11Z","timestamp":1273328231000},"page":"589-606","source":"Crossref","is-referenced-by-count":11,"title":["Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems"],"prefix":"10.1007","volume":"49","author":[{"given":"George","family":"Mavrotas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9 Rui","family":"Figueira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandros","family":"Antoniadis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,5,9]]},"reference":[{"key":"9552_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(03)00274-1","volume":"155","author":"A. Fr\u00e9ville","year":"2004","unstructured":"Fr\u00e9ville A.: The multidimensional 0\u20131 knapsack problem: an overview. Eur. J. Oper. Res. 155, 1\u201321 (2004)","journal-title":"Eur. J. Oper. Res."},{"key":"9552_CR2","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)"},{"key":"9552_CR3","first-page":"195","volume-title":"Lecture Notes on Computer Sciences 3906","author":"J. Puchinger","year":"2006","unstructured":"Puchinger J., Raidl G.R., Pferschy U.: The core concept for the multidimensional knapsack problem. In: Gottlieb, J., Raidl, G.R. (eds) Lecture Notes on Computer Sciences 3906, pp. 195\u2013208. Springer, Berlin (2006)"},{"key":"9552_CR4","doi-asserted-by":"crossref","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\u2013one knapsack problems. Oper. Res. 28, 1130\u20131154 (1980)","journal-title":"Oper. Res."},{"key":"9552_CR5","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1287\/mnsc.34.5.633","volume":"34","author":"S. Martello","year":"1988","unstructured":"Martello S., Toth P.: A new algorithm for the 0\u20131 knapsack problem. Manag. Sci. 34, 633\u2013644 (1988)","journal-title":"Manag. Sci."},{"key":"9552_CR6","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)"},{"key":"9552_CR7","unstructured":"Pisinger, D.: Algorithms for Knapsack problems. Ph.D. Thesis, Dept. of Computer Science, University of Copenhagen (1995)"},{"key":"9552_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., Climaco J., Figueira J.: Core problems in bi-criteria {0, 1}-knapsack problems. Comput. Oper. Res. 35, 2292\u20132306 (2008)","journal-title":"Comput. Oper. Res."},{"key":"9552_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-77247-9","volume-title":"Pareto Optimality, Game Theory and Equilibria, Series, vol. 17","author":"A. Chinchuluun","year":"2008","unstructured":"Chinchuluun A., Pardalos P.M., Migdalas A., Pitsoulis L.: Pareto Optimality, Game Theory and Equilibria, Series, vol. 17. Springer, Berlin (2008)"},{"issue":"1","key":"9552_CR10","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/s10479-007-0186-0","volume":"154","author":"A. Chinchuluun","year":"2007","unstructured":"Chinchuluun A., Pardalos P.M.: A survey of recent developments in multiobjective optimization. Ann. Oper. Res. 154(1), 29\u201350 (2007)","journal-title":"Ann. Oper. Res."},{"key":"9552_CR11","doi-asserted-by":"crossref","unstructured":"Mavrotas, G., Figueira, J.R., Florios, K.: Solving the bi-objective multidimensional knapsack problem exploiting the concept of core. Appl. Math. Comput. 215(7), 2502-2514","DOI":"10.1016\/j.amc.2009.08.045"},{"key":"9552_CR12","doi-asserted-by":"crossref","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\u2013one multiple objective linear programming. Eur. J. Oper. Res. 107, 530\u2013541 (1998)","journal-title":"Eur. J. Oper. Res."},{"key":"9552_CR13","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.amc.2005.01.038","volume":"171","author":"G. Mavrotas","year":"2005","unstructured":"Mavrotas G., Diakoulaki D.: Multi-criteria branch & bound: a vector maximization algorithm for mixed 0\u20131 multiple objective linear programming. Appl. Math. Comput. 171, 53\u201371 (2005)","journal-title":"Appl. Math. Comput."},{"key":"9552_CR14","doi-asserted-by":"crossref","first-page":"866","DOI":"10.1016\/j.amc.2004.09.067","volume":"169","author":"G.R Jahanshahloo","year":"2005","unstructured":"Jahanshahloo G.R, Hosseinzadeh F., Shoja N., Tohidi G.: A method for generating all efficient solutions of 0\u20131 multiobjective linear programming problem. Appl. Math. Comput. 169, 866\u2013874 (2005)","journal-title":"Appl. Math. Comput."},{"key":"9552_CR15","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1016\/j.amc.2007.04.062","volume":"194","author":"F. Jolai","year":"2007","unstructured":"Jolai F., Rezaee MJ., Rabbani M., Razmi J., Fattahi P.: Exact algorithm for bi-objective 0\u20131 knapsack problem. Appl. Math. Comput. 194, 544\u2013551 (2007)","journal-title":"Appl. Math. Comput."},{"key":"9552_CR16","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., Ulungu E.L.: Two-phase method and branch and bound procedures to solve the bi-objective knapsack problem. J. Glob. Optim. 12, 139\u2013155 (1998)","journal-title":"J. Glob. Optim."},{"key":"9552_CR17","volume-title":"Multiple Criteria Optimization-Theory, Computation and Application","author":"R.E. Steuer","year":"1989","unstructured":"Steuer R.E.: Multiple Criteria Optimization-Theory, Computation and Application. 2nd edn. Krieger, Malabar (1989)","edition":"2"},{"key":"9552_CR18","first-page":"1","volume-title":"Multiple Criteria Decision Making","author":"R.E. Steuer","year":"1995","unstructured":"Steuer R.E.: The ADBASE multiple objective linear programming package. In: Gu, J., Chen, G., Wei, Q., Wang, S. (eds) Multiple Criteria Decision Making, pp. 1\u20136. Windsor, England (1995)"},{"key":"9552_CR19","unstructured":"Mavrotas, G.: Multiple Objective Programming under Uncertainty: Development of a Decision Support System and Implementation in Energy Planning. Ph.D. Thesis, National Technical University of Athens, Athens (2000)"},{"key":"9552_CR20","volume-title":"GAMS. A user\u2019s guide","author":"A. Brooke","year":"1998","unstructured":"Brooke A., Kendrick D., Meeraus A., Raman R.: GAMS. A user\u2019s guide. GAMS development corporation, Washington (1998)"},{"key":"9552_CR21","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1023\/B:JMMA.0000038617.09620.02","volume":"3","author":"C. Gomes da Silva","year":"2004","unstructured":"Gomes da Silva C., Climaco J., Figueira J.: A scatter search method for the bi-criteria multi-dimensional {0,1}-knapsack problem using surrogate relaxation. J. Math. Model. Algorit. 3, 183\u2013208 (2004)","journal-title":"J. Math. Model. Algorit."},{"key":"9552_CR22","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1023\/A:1009642405419","volume":"4","author":"P.C. Chu","year":"1998","unstructured":"Chu P.C., Beasley J.: A genetic algorithm for the multidimensional knapsack problem. J. Heuristics 4, 63\u201386 (1998)","journal-title":"J. Heuristics"},{"key":"9552_CR23","doi-asserted-by":"crossref","first-page":"932","DOI":"10.1016\/j.ejor.2004.08.029","volume":"169","author":"M. Laumanns","year":"2006","unstructured":"Laumanns M., Thiele L., Zitzler E.: An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method. Eur. J. Oper. Res. 169, 932\u2013942 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"9552_CR24","unstructured":"Gomes da Silva, C., Figueira, J., Climaco, J.: An exact method for the bicriteria {0,1}-knapsack problem based on functions specialization, Research Report no 24, INESC-Coimbra, Portugal (2004)"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-010-9552-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-010-9552-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-010-9552-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:58:55Z","timestamp":1559278735000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-010-9552-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5,9]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,4]]}},"alternative-id":["9552"],"URL":"https:\/\/doi.org\/10.1007\/s10898-010-9552-6","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,5,9]]}}}