Bicriteria transportation problem, Management Science, vol.25, pp.73-78, 1979. ,
An efficient implementation for the 0-1 multiobjective knapsack problem, WEA, pp.406-419, 2007. ,
Solving efficiently the 0-1 multi-objective knapsack problem, Computers and Operations Research, vol.36, issue.1, pp.260-279, 2009. ,
A combined approach to solve binary multicriteria problems, Naval Research Logistics Quarterly, vol.29, pp.181-201, 1982. ,
Solving bicriteria 0-1 knapsack problems using a labeling algorithm, Comput. Oper. Res, vol.30, issue.12, pp.1865-1886, 2003. ,
Note on multiple objective dynamic programming, Journal of the Operational Research Society, vol.31, pp.591-594, 1980. ,
Approximative solution methods for multiobjective combinatorial optimization, Journal of the Spanish Statistical and Operations Research Society, vol.12, issue.1, pp.1-88, 2004. ,
Bound sets for biobjective combinatorial optimization problems, Computers & Operations Research, vol.34, issue.9, pp.2674-2694, 2007. ,
Integer Programming, 1972. ,
Knapsack Problems, 2004. ,
An algorithm for multiobjective zero-one linear programming, Management Science, vol.29, issue.12, pp.1444-1453, 1983. ,
Dynamic programming approaches to the multiple criteria knapsack problem, Naval Research Logistics, vol.47, pp.57-76, 2000. ,
The multiobjective multidimensional knapsack problem: a survey and a new approach, 2010. ,
An interactive branch-and-bound algorithm for multiple criteria optimization, Management Science, vol.32, issue.1, pp.61-75, 1986. ,
Dynamic programming and strong bounds for the 0-1 knapsack problem, Management Science, vol.45, pp.414-424, 1999. ,
A new approach to computing optimal schedules for the job shop scheduling problem, Proceedings of the Fifth international IPCO conference, pp.389-403, 1996. ,
A branch and bound algorithm for mixed zero-one multiple objective linear programming, European Journal of Operational Research, vol.107, pp.530-541, 1998. ,
Branch and bound strategies for dynamic programming, Operations Research, vol.24, pp.611-627, 1976. ,
Two phase algorithms for the bi-objective assignment problem, European Journal of Operational Research, vol.185, issue.2, pp.509-533, 2008. ,
URL : https://hal.archives-ouvertes.fr/hal-00461989
A multi-objective branch-and-bound framework. Application to the bi-objective spanning tree problem, INFORMS Journal of Computing, vol.20, issue.3, pp.472-484, 2008. ,
Computing all efficient solutions of the biobjective minimum spanning tree problem, Comput. Oper. Res, vol.35, issue.1, pp.198-211, 2008. ,
The two phases method: An efficient procedure to solve bi-objective combinatorial optimization problems, Foundations of Computing and Decision Sciences, vol.20, issue.2, pp.149-165, 1995. ,
Multicriteria integer programming: A (hybrid) dynamic programming recursive approach, Mathematical Programming, vol.49, issue.1, pp.204-223, 1981. ,
DOI : 10.1007/BF01584241
Two-phases method and branch and bound procedures to solve the bi?objective knapsack problem, J. of Global Optimization, vol.12, issue.2, pp.139-155, 1998. ,