Solving bicriteria 0–1 knapsack problems using a labeling algorithm

Martello, 1990 Rosenblatt, 1989, Generating the discrete efficient frontier to the capital budgeting problem, Operations Research, 37, 384, 10.1287/opre.37.3.384 Kwak, 1996, Capital budgeting with multiple criteria and multiple decision makers, Review of Finance and Accounting, 7, 97 Teng, 1996, A multiobjective programming approach for selecting non-independent transportation investment alternatives, Transportation Research-B, 30, 291, 10.1016/0191-2615(95)00032-1 Kostreva, 1999, Relocation problems arising in conservation biology, Computers and Mathematics with Applications, 37, 135, 10.1016/S0898-1221(99)00065-6 Visée, 1998, Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem, Journal of the Global Optimization, 12, 139, 10.1023/A:1008258310679 Klamroth, 2000, Dynamic programming approaches to the multiple criteria knapsack problems, Naval Research Logistics Quarterly, 47, 57, 10.1002/(SICI)1520-6750(200002)47:1<57::AID-NAV4>3.0.CO;2-4 Hansen M. Solving multiobjective knapsack problems using MOTS. Conference Paper presented at MIC’97, Sophia Antipolis, France, July, 21–4, 1997. 9pp. Ulungu, 1999, Mosa method, Journal of Multi-Criteria Decision Analysis, 8, 221, 10.1002/(SICI)1099-1360(199907)8:4<221::AID-MCDA247>3.3.CO;2-F Ben Abdelaziz, 1999, A hybrid heuristic for multiobjective knapsack problems, 205 Martins E, Santos JL. The labelling algorithm for the multiobjective shortest path problem. Technical Report 99/005 CISUC, Departamento de Matemática, Universidade de Coimbra, Portugal, 1999. 24pp. (http://www.mat.uc.pt/~eqvm/eqvm.html). Ahuja, 1993 Hansen, 1980, Bicriterion path problems, vol. 177, 109 Clı́maco, 1982, A bicriterion shortest path algorithm, European Journal of Operational Research, 11, 399, 10.1016/0377-2217(82)90205-3 Martins, 1984, On a multicriteria shortest path problem, European Journal of Operational Research, 16, 236, 10.1016/0377-2217(84)90077-8 Martins, 2000, A new shortest path ranking algorithm, Investigação Operacional, 20, 47 Klingman, 1974, Netgen, Management Science, 20, 814, 10.1287/mnsc.20.5.814 Martins, 1999, Deviation algorithms for ranking shortest paths, International Journal of Fundations of Computer Science, 10, 247, 10.1142/S0129054199000186 Martins, 2001, A new improvement for a K Shortest paths algorithm, Investigação Operacional, 21, 47