{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:26:30Z","timestamp":1761596790479},"reference-count":19,"publisher":"Elsevier BV","issue":"12","license":[{"start":{"date-parts":[[2003,10,1]],"date-time":"2003-10-01T00:00:00Z","timestamp":1064966400000},"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 &amp; Operations Research"],"published-print":{"date-parts":[[2003,10]]},"DOI":"10.1016\/s0305-0548(02)00112-0","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:10:20Z","timestamp":1052766620000},"page":"1865-1886","source":"Crossref","is-referenced-by-count":68,"title":["Solving bicriteria 0\u20131 knapsack problems using a labeling algorithm"],"prefix":"10.1016","volume":"30","author":[{"given":"M.","family":"Eug\u00e9nia Captivo","sequence":"first","affiliation":[]},{"given":"Jo\u00e3o","family":"Cl\u0131\u0301maco","sequence":"additional","affiliation":[]},{"given":"Jos\u00e9","family":"Figueira","sequence":"additional","affiliation":[]},{"given":"Ernesto","family":"Martins","sequence":"additional","affiliation":[]},{"given":"Jos\u00e9","family":"Luis Santos","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(02)00112-0_BIB1","series-title":"Knapsack problems: algorithms and computer implementations","author":"Martello","year":"1990"},{"issue":"3","key":"10.1016\/S0305-0548(02)00112-0_BIB2","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1287\/opre.37.3.384","article-title":"Generating the discrete efficient frontier to the capital budgeting problem","volume":"37","author":"Rosenblatt","year":"1989","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(02)00112-0_BIB3","first-page":"97","article-title":"Capital budgeting with multiple criteria and multiple decision makers","volume":"7","author":"Kwak","year":"1996","journal-title":"Review of Finance and Accounting"},{"key":"10.1016\/S0305-0548(02)00112-0_BIB4","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0191-2615(95)00032-1","article-title":"A multiobjective programming approach for selecting non-independent transportation investment alternatives","volume":"30","author":"Teng","year":"1996","journal-title":"Transportation Research-B"},{"key":"10.1016\/S0305-0548(02)00112-0_BIB5","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/S0898-1221(99)00065-6","article-title":"Relocation problems arising in conservation biology","volume":"37","author":"Kostreva","year":"1999","journal-title":"Computers and Mathematics with Applications"},{"key":"10.1016\/S0305-0548(02)00112-0_BIB6","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 the Global Optimization"},{"issue":"1","key":"10.1016\/S0305-0548(02)00112-0_BIB7","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1002\/(SICI)1520-6750(200002)47:1<57::AID-NAV4>3.0.CO;2-4","article-title":"Dynamic programming approaches to the multiple criteria knapsack problems","volume":"47","author":"Klamroth","year":"2000","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0305-0548(02)00112-0_BIB8","unstructured":"Hansen M. Solving multiobjective knapsack problems using MOTS. Conference Paper presented at MIC\u201997, Sophia Antipolis, France, July, 21\u20134, 1997. 9pp."},{"key":"10.1016\/S0305-0548(02)00112-0_BIB9","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1002\/(SICI)1099-1360(199907)8:4<221::AID-MCDA247>3.3.CO;2-F","article-title":"Mosa method","volume":"8","author":"Ulungu","year":"1999","journal-title":"Journal of Multi-Criteria Decision Analysis"},{"key":"10.1016\/S0305-0548(02)00112-0_BIB10","series-title":"Meta-heuristics: advances and trends in local search paradigms for optimization","first-page":"205","article-title":"A hybrid heuristic for multiobjective knapsack problems","author":"Ben Abdelaziz","year":"1999"},{"key":"10.1016\/S0305-0548(02)00112-0_BIB11","unstructured":"Martins E, Santos JL. The labelling algorithm for the multiobjective shortest path problem. Technical Report 99\/005 CISUC, Departamento de Matem\u00e1tica, Universidade de Coimbra, Portugal, 1999. 24pp. (http:\/\/www.mat.uc.pt\/~eqvm\/eqvm.html)."},{"key":"10.1016\/S0305-0548(02)00112-0_BIB12","series-title":"Network flows: theory, algorithms, and applications","author":"Ahuja","year":"1993"},{"key":"10.1016\/S0305-0548(02)00112-0_BIB13","series-title":"Multiple criteria decision making: theory and applications","first-page":"109","article-title":"Bicriterion path problems","volume":"vol. 177","author":"Hansen","year":"1980"},{"key":"10.1016\/S0305-0548(02)00112-0_BIB14","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1016\/0377-2217(82)90205-3","article-title":"A bicriterion shortest path algorithm","volume":"11","author":"Cl\u0131\u0301maco","year":"1982","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(02)00112-0_BIB15","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/0377-2217(84)90077-8","article-title":"On a multicriteria shortest path problem","volume":"16","author":"Martins","year":"1984","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(02)00112-0_BIB16","first-page":"47","article-title":"A new shortest path ranking algorithm","volume":"20","author":"Martins","year":"2000","journal-title":"Investiga\u00e7\u00e3o Operacional"},{"issue":"5","key":"10.1016\/S0305-0548(02)00112-0_BIB17","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1287\/mnsc.20.5.814","article-title":"Netgen","volume":"20","author":"Klingman","year":"1974","journal-title":"Management Science"},{"issue":"3","key":"10.1016\/S0305-0548(02)00112-0_BIB18","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1142\/S0129054199000186","article-title":"Deviation algorithms for ranking shortest paths","volume":"10","author":"Martins","year":"1999","journal-title":"International Journal of Fundations of Computer Science"},{"issue":"1","key":"10.1016\/S0305-0548(02)00112-0_BIB19","first-page":"47","article-title":"A new improvement for a K Shortest paths algorithm","volume":"21","author":"Martins","year":"2001","journal-title":"Investiga\u00e7\u00e3o Operacional"}],"container-title":["Computers &amp; Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054802001120?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054802001120?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T03:25:05Z","timestamp":1553916305000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054802001120"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,10]]},"references-count":19,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2003,10]]}},"alternative-id":["S0305054802001120"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(02)00112-0","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2003,10]]}}}