{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,30]],"date-time":"2023-10-30T05:20:24Z","timestamp":1698643224527},"reference-count":24,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[2008,7,1]],"date-time":"2008-07-01T00:00:00Z","timestamp":1214870400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2008,7]]},"DOI":"10.1016\/j.cor.2006.11.001","type":"journal-article","created":{"date-parts":[[2007,1,19]],"date-time":"2007-01-19T12:19:09Z","timestamp":1169209149000},"page":"2292-2306","source":"Crossref","is-referenced-by-count":18,"title":["Core problems in bi-criteria -knapsack problems"],"prefix":"10.1016","volume":"35","author":[{"given":"Carlos","family":"Gomes da Silva","sequence":"first","affiliation":[]},{"given":"Jo\u00e3o","family":"Cl\u00edmaco","sequence":"additional","affiliation":[]},{"given":"Jos\u00e9","family":"Rui Figueira","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.cor.2006.11.001_bib1","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1287\/opre.5.2.266","article-title":"Discrete variable extremum problems","volume":"5","author":"Dantzig","year":"1957","journal-title":"Operations Research"},{"key":"10.1016\/j.cor.2006.11.001_bib2","doi-asserted-by":"crossref","first-page":"1130","DOI":"10.1287\/opre.28.5.1130","article-title":"An algorithm for large zero\u2013one knapsack problems","volume":"28","author":"Balas","year":"1980","journal-title":"Operational Research"},{"key":"10.1016\/j.cor.2006.11.001_bib3","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF02241754","article-title":"An algorithm for the solution of the 0\u20131 knapsack problem","volume":"28","author":"Fayard","year":"1982","journal-title":"Computing"},{"key":"10.1016\/j.cor.2006.11.001_bib4","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1287\/mnsc.34.5.633","article-title":"A new algorithm for the 0\u20131 knapsack problems","volume":"34","author":"Martello","year":"1988","journal-title":"Management Science"},{"key":"10.1016\/j.cor.2006.11.001_bib5","series-title":"Knapsack problems\u2014algorithms and computer implementations","author":"Martello","year":"1990"},{"key":"10.1016\/j.cor.2006.11.001_bib6","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0377-2217(94)00013-3","article-title":"An expanding-core algorithm for the exact 0\u20131 knapsack problem","volume":"87","author":"Pisinger","year":"1995","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.cor.2006.11.001_bib7","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1287\/mnsc.45.3.414","article-title":"Dynamic programming and strong bounds for the {0,1}-knapsack problems","volume":"45","author":"Martello","year":"1999","journal-title":"Management Science"},{"key":"10.1016\/j.cor.2006.11.001_bib8","doi-asserted-by":"crossref","first-page":"758","DOI":"10.1287\/opre.45.5.758","article-title":"A minimal algorithm for the {0,1}-knapsack problem","volume":"45","author":"Pisinger","year":"1997","journal-title":"Operations Research"},{"key":"10.1016\/j.cor.2006.11.001_bib9","series-title":"Knapsack in problems","author":"Kellerer","year":"2004"},{"key":"10.1016\/j.cor.2006.11.001_bib10","series-title":"Multiple criteria optimization, theory, computation and application","author":"Steuer","year":"1986"},{"key":"10.1016\/j.cor.2006.11.001_bib11","series-title":"Multicriteria analysis","first-page":"269","article-title":"Solving multi-objective knapsack problem by branch-and-bound procedure","author":"Ulungu","year":"1997"},{"key":"10.1016\/j.cor.2006.11.001_bib12","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1023\/A:1008258310679","article-title":"Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem","volume":"12","author":"Vis\u00e9e","year":"1998","journal-title":"Journal of Global Optimization"},{"key":"10.1016\/j.cor.2006.11.001_bib13","doi-asserted-by":"crossref","first-page":"1865","DOI":"10.1016\/S0305-0548(02)00112-0","article-title":"Solving multiple criteria 0\u20131 knapsack problems using a labeling algorithm","volume":"30","author":"Captivo","year":"2003","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.cor.2006.11.001_bib14","first-page":"429","article-title":"The supported solutions used as a genetic information in a population heuristic","volume":"vol. 1993","author":"Gandibleux","year":"2001"},{"issue":"3","key":"10.1016\/j.cor.2006.11.001_bib15","doi-asserted-by":"crossref","first-page":"1656","DOI":"10.1016\/j.ejor.2005.10.013","article-title":"Integrating partial optimization with scatter search for solving bi-criteria {0,1}-knapsack problems","volume":"177","author":"Gomes da Silva","year":"2007","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/j.cor.2006.11.001_bib16","first-page":"73","article-title":"A scatter search method for the bi-criteria knapsack problems","volume":"169","author":"Gomes da Silva","year":"2006","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.cor.2006.11.001_bib17","unstructured":"Gomes da Silva C, Figueira J, Cl\u00edmaco J. An interactive procedure for the bi-criteria knapsack problem. Research Report, No. 4, INESC-Coimbra, Portugal, 2003, [in Portuguese] \u3008http:\/\/www.inescc.pt\/download\/RR2003_04.pdf\u3009."},{"key":"10.1016\/j.cor.2006.11.001_bib18","unstructured":"Gomes da Silva C, Cl\u00edmaco J, Figueira J. Geometrical configuration of Pareto frontier of bi-criteria {0,1}-knapsack. Research Report, No. 8, INESC-Coimbra, Portugal, 2004."},{"key":"10.1016\/j.cor.2006.11.001_bib19","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF01584332","article-title":"Linear multiple objective programs with zero\u2013one variables","volume":"13","author":"Bitran","year":"1977","journal-title":"Mathematical Programming"},{"issue":"3","key":"10.1016\/j.cor.2006.11.001_bib20","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1007\/BF01588256","article-title":"Theory and algorithms for linear multiple objective programs with zero\u2013one variables","volume":"17","author":"Bitran","year":"1979","journal-title":"Mathematical Programming"},{"key":"10.1016\/j.cor.2006.11.001_bib21","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1002\/nav.3800290202","article-title":"A combined approach to solve binary multicriteria problems","volume":"29","author":"Bitran","year":"1982","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/j.cor.2006.11.001_bib22","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1016\/0377-2217(83)90157-1","article-title":"Solving zero\u2013one multiple objective programs through implicit enumeration","volume":"12","author":"Deckro","year":"1982","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.cor.2006.11.001_bib23","unstructured":"Gomes da Silva C, Figueira J, Cl\u00edmaco J. An exact method for the bi-criteria {0,1}-knapsack problem based on functions specialization. Research Report, No. 24, INESC-Coimbra, Portugal, 2004. \u3008http:\/\/www.inescc.pt\/download\/RR2004_24.pdf\u3009."},{"issue":"4","key":"10.1016\/j.cor.2006.11.001_bib24","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1287\/opre.47.4.570","article-title":"Core problems in knapsack algorithms","volume":"47","author":"Pisinger","year":"1999","journal-title":"Operations Research"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054806002917?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054806002917?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,9]],"date-time":"2019-01-09T21:28:16Z","timestamp":1547069296000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054806002917"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7]]},"references-count":24,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2008,7]]}},"alternative-id":["S0305054806002917"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2006.11.001","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2008,7]]}}}