{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T22:41:26Z","timestamp":1649112086520},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,10,15]],"date-time":"2009-10-15T00:00:00Z","timestamp":1255564800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1007\/s10288-009-0110-3","type":"journal-article","created":{"date-parts":[[2009,10,13]],"date-time":"2009-10-13T23:50:52Z","timestamp":1255477852000},"page":"195-211","source":"Crossref","is-referenced-by-count":2,"title":["The small world of efficient solutions: empirical evidence from the bi-objective {0,1}-knapsack problem"],"prefix":"10.1007","volume":"8","author":[{"given":"Carlos","family":"Gomes da Silva","sequence":"first","affiliation":[]},{"given":"Jo\u00e3o","family":"Cl\u00edmaco","sequence":"additional","affiliation":[]},{"given":"Adiel Almeida","family":"Filho","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,10,15]]},"reference":[{"key":"110_CR1","doi-asserted-by":"crossref","first-page":"3247","DOI":"10.1016\/j.cor.2009.02.027","volume":"36","author":"B Aghezzaf","year":"2009","unstructured":"Aghezzaf B, Naimi M (2009) The two-stage recombination operator and its application to the multi-objective 0\/1 knapsack problem: a comparative study. Comp Oper Res 36: 3247\u20133262","journal-title":"Comp Oper Res"},{"key":"110_CR2","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R Albert","year":"2002","unstructured":"Albert R, Barab\u00e1si A (2002) Statistical mechanics of complex networks. Rev Mod Phys 74: 47\u201397","journal-title":"Rev Mod Phys"},{"key":"110_CR3","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1038\/43601","volume":"401","author":"R Albert","year":"1999","unstructured":"Albert R, Jeong H, Barab\u00e1si A (1999) Diameter of the world-wide web. Nature 401: 130","journal-title":"Nature"},{"issue":"21","key":"110_CR4","doi-asserted-by":"crossref","first-page":"11149","DOI":"10.1073\/pnas.200327197","volume":"97","author":"L Amaral","year":"2000","unstructured":"Amaral L, Scala A, Barth\u00e9l\u00e9my M, Stanley H (2000) Classes of small world networks. Proc Natl Acad Sci 97(21): 11149\u201311152","journal-title":"Proc Natl Acad Sci"},{"issue":"1","key":"110_CR5","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 (2009a) Implementing an efficient fptas for the 0-1 multi-objective knapsack problem. Eur J Oper Res 198(1): 47\u201356","journal-title":"Eur J Oper Res"},{"key":"110_CR6","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 (2009b) Solving efficiently the 0-1 multi-objective knapsack problem. Comp Oper Res 36: 260\u2013279","journal-title":"Comp Oper Res"},{"key":"110_CR7","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/978-3-540-72792-7_5","volume":"4153","author":"R Beier","year":"2007","unstructured":"Beier R, R\u00f6glin H, V\u00f6cking B (2007) The smoothed number of pareto optimal solutions in bicriteria integer optimization. Lect Notes Comput Sci 4153: 53\u201367","journal-title":"Lect Notes Comput Sci"},{"key":"110_CR8","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, Santos JL (2003) Solving multiple criteria 0,1-knapsack problems using a labeling algorithm. Comp Oper Res 30: 1865\u20131886","journal-title":"Comp Oper Res"},{"key":"110_CR9","volume-title":"Multi-objective programming and planning","author":"J Cohon","year":"1978","unstructured":"Cohon J (1978) Multi-objective programming and planning. Academic Press, London"},{"key":"110_CR10","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198515906.001.0001","volume-title":"Evolution of networks\u2014from biology nets to the internet and WWW","author":"S Dorogovtesv","year":"2003","unstructured":"Dorogovtesv S, Mendes F (2003) Evolution of networks\u2014from biology nets to the internet and WWW. Oxford University Press, Oxford"},{"issue":"1","key":"110_CR11","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/S0377-2217(96)00116-6","volume":"97","author":"M Ehrgott","year":"1997","unstructured":"Ehrgott M, Klamroth K (1997) Connectedness of efficient solutions in multicriteria combinatorial optimization. Eur J Oper Res 97(1): 159\u2013166","journal-title":"Eur J Oper Res"},{"key":"110_CR12","first-page":"290","volume":"6","author":"P Erd\u00f6s","year":"1959","unstructured":"Erd\u00f6s P, R\u00e9nyi A (1959) On random graph. Publ Math 6: 290\u2013297","journal-title":"Publ Math"},{"key":"110_CR13","unstructured":"Gomes da Silva C (2005) Finding the set of non-dominated solutions in the bi-objective 0,1-knapsack: an approach with meta-heuristics and exact methods. PhD thesis, Faculty of Economics, University of Coimbra"},{"key":"110_CR14","unstructured":"Gomes da Silva C, Cl\u00edmaco J (2008) Finding communities in the efficient solutions network. Technical report, Institute for Systems and Computers Engineering, Coimbra, Portugal"},{"key":"110_CR15","unstructured":"Gomes da Silva C, Cl\u00edmaco J, Figueira J (2004) Geometrical configuration of the pareto frontier of bi-criteria 0,1-knapsack problems. Technical report, Institute for Systems and Computers Engineering, Coimbra, Portugal"},{"issue":"2","key":"110_CR16","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 (2006) A scatter search method dedicated to the bi-objective knapsack problems. Eur J Oper Res 169(2): 373\u2013391","journal-title":"Eur J Oper Res"},{"issue":"7","key":"110_CR17","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 (2008) Core problems in bi-objective 0-1 knapsack problems. Comp Oper Res 35(7): 2292\u20132306","journal-title":"Comp Oper Res"},{"key":"110_CR18","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 (2007) Integrating partial optimization with scatter search for solving bi-objective 0,1-knapsack problems. Eur J Oper Res 177: 1656\u20131677","journal-title":"Eur J Oper Res"},{"key":"110_CR19","unstructured":"Gorski J, Klamroth K, Ruzika S (2006) Connectedness of efficient solutions in multiple objective combinatorial optimization. Technical report, Department of Mathematics, University of Kaiserslautern"},{"key":"110_CR20","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1038\/43604","volume":"401","author":"B Huberman","year":"2000","unstructured":"Huberman B, Adamic L (2000) Growth dynamics of the world-wide web. Nature 401: 131","journal-title":"Nature"},{"issue":"1","key":"110_CR21","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 (2000) Dynamic programming approaches to the multiple criteria knapsack problem. Nav Res Logist 47(1): 57\u201376","journal-title":"Nav Res Logist"},{"key":"110_CR22","volume-title":"Knapsack problems\u2014algorithms and computer implementations","author":"S Martello","year":"1990","unstructured":"Martello S, Toth P (1990) Knapsack problems\u2014algorithms and computer implementations. Wiley, New York"},{"issue":"1","key":"110_CR23","first-page":"60","volume":"1","author":"S Milgram","year":"1967","unstructured":"Milgram S (1967) The small world problem. Psychol Today 1(1): 60\u201367","journal-title":"Psychol Today"},{"key":"110_CR24","first-page":"026113.1","volume":"69","author":"M Newman","year":"2004","unstructured":"Newman M, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev E 69: 026113.1\u2013026113.15","journal-title":"Phys Rev E"},{"key":"110_CR25","unstructured":"Ruzika S (2008) On multiple objective combinatorial optimization. PhD thesis, Department of Mathematics, University of Kaisreslautern"},{"key":"110_CR26","volume-title":"Multiple criteria optimization, theory, computation and application","author":"R Steuer","year":"1986","unstructured":"Steuer R (1986) Multiple criteria optimization, theory, computation and application. Wiley, New York"},{"key":"110_CR27","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 (1998) Two phases method and branch and bound procedures to solve the bi-objective knapsack problem. J Glob Optim 12: 139\u2013155","journal-title":"J Glob Optim"},{"key":"110_CR28","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1016\/S0377-2217(03)00420-X","volume":"159","author":"CW Zhang","year":"2004","unstructured":"Zhang CW, Ong HL (2004) Solving the biobjective zero-one knapsack problem by an efficient lp-based heuristic. Eur J Oper Res 159: 545\u2013557","journal-title":"Eur J Oper Res"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-009-0110-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-009-0110-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-009-0110-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T12:12:56Z","timestamp":1559131976000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-009-0110-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,10,15]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,6]]}},"alternative-id":["110"],"URL":"https:\/\/doi.org\/10.1007\/s10288-009-0110-3","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,10,15]]}}}