Finding non-dominated solutions in bi-objective integer network flow problems

Computers and Operations Research

Volumn 36, Issue 9, 2009, Pages 2554-2564

  Eusébio, Augusto ^a,b   Figueira, José Rui ^b,c  

^a POLYTECHNIC INSTITUTE OF LEIRIA   (Portugal)

^b INSTITUTO SUPERIOR TÉCNICO   (Portugal)

^c UNIVERSITÉ PARIS DAUPHINE   (France)

Author keywords

Bi objective integer network flows; Efficient solutions; Network simplex algorithm; Non dominated solutions

Indexed keywords

LINEAR PROGRAMMING;

COMPUTATIONAL ISSUES; CONSTRAINT PROBLEMS; NETWORK FLOW PROBLEMS; NETWORK FLOWS; NONDOMINATED SOLUTIONS; OBJECTIVE FUNCTIONS; OPTIMAL INTEGER SOLUTION; SIMPLEX ALGORITHM;

BRANCH AND BOUND METHOD;

EID: 60349107253     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2008.11.001     Document Type: Article

References (33)

1. Ahuja R., Magnanti T.L., and Orlin J. Network flows: theory, algorithms, and applications (1993), Prentice-Hall, New Jersey
2. Lee H., and Pulat P.S. Bicriteria network flow problems: continuous case. European Journal of Operational Research 51 (1991) 119-126
3. Malhotra R., and Puri M.C. Bi-criteria network problem. Cahiers du CERO 26 1 (1984) 95-102
4. Pulat P.S., Huarng F., and Lee H. Efficient solutions for the bicriteria network flow problem. Computers & Operations Research 19 7 (1992) 649-655
5. Sedeño-Noda A., and González-Martín C. The biobjective minimum cost flow problem. European Journal of Operational Research 124 (2000) 591-600
6. Sedeño-Noda A., and González-Martín C. An alternative method to solve the biobjective minimum cost flow problem. Asia-Pacific Journal of Operational Research 20 (2003) 241-260
7. Figueira JR. On the integer bi-criteria network flow problem: a branch-and-bound approach. Research Report No. 3/2000 MSG, Faculdade de Economia da Universidade de Coimbra, Coimbra, Portugal [also in Cahiers du LAMSADE, 191, 2002].
8. Figueira JR. Filtering algorithm for integer bi-criteria network flows. Manuscript, 2001.
9. Gouveia MC. The bi-criteria network flow problem: a study of an algorithm for computing all the efficient solutions. Master's thesis, Faculdade de Economia da Universidade de Coimbra, Coimbra, Portugal, 2002 [in Portuguese].
10. Huarng F, Pulat P, Ravindran A. An algorithm for bicriteria integer network flow problem. In: Proceedings of the 10th international conference on multiple criteria decision making, vol. 3, Taipei, Taiwan, 1992. Preprint, National Chiao Tung University, p. 305-18.
11. Lee H., and Pulat P.S. Bicriteria network flow problems: integer case. European Journal of Operational Research 66 (1993) 148-157
12. Przybylski A., Gandibleux X., and Ehrgott M. The biobjective integer minimum cost flow problem-incorrectness of Sedeño-Noda and González-Martín's algorithm. Computers & Operations Research 33 5 (2006) 1459-1463
13. Sedeño-Noda A., and González-Martín C. An algorithm for the biobjective integer minimum cost flow problem. Computers & Operations Research 28 (2001) 139-156
14. Hamacher H.W., Pedersen C.R., and Ruzika S. Multiple objective minimum cost flow problems: a review. European Journal of Operational Research 176 (2007) 1404-1422
15. Lee H. Integer solutions of bicriteria network flow problems. PhD thesis, University of Oklahoma, Norman, OK, 1989.
16. Steuer R.E. Multiple criteria optimization: theory, computation, and application (1986), Wiley, New York
17. Zadeh N. A bad network for the simplex method and other minimum flow algorithms. Mathematical Programming 5 (1973) 255-266
18. Ruhe G. Complexity results for multicriterial and parametric network flows using a pathological graph of Zadeh. Zeitschrift für Operations Research 32 (1988) 9-27
19. Sedeño-Noda A., and González-Martín C. An algorithm for the biobjective integer minimum cost flow problem. Computers & Operations Research 28 (2001) 139-156
20. Eusébio A, Figueira JR. On the computation of all supported efficient solutions in multi-objective. European Journal of Operational Research 2008; in press, doi:10.1016/j.ejor.2008.10.031.
21. Bazaraa M.S., Jarvis J.J., and Sherali H.D. Linear programming and network flows (1977), Wiley, New York
22. Ehrgott M. Multicriteria optimization. 2nd ed. (2005), Springer, Berlin
23. Ulungu E.L., and Teghem J. The two phases method: an efficient procedure to solve bi-objective combinatorial optimization problems. Foundations of Computing & Decision Sciences 20 2 (1995) 149-165
24. Dauer J.P. Analysis of the objective space in multiple objective linear programming. Journal of Optimization Theory and Applications 126 (1987) 579-593
25. Zeleny M. Linear multiobjective programming. In: Lecture notes in economics and mathematical systems, vol. 95. New York: Springer; 1972.
26. Pareto V. Cours d'economie politique (1896), Rouge, Lausanne
27. Chankong V., and Haimes Y.Y. Multiobjective decision maker: theory and methodology (1983), North-Holland, New York
28. Grigoriadis M.D. An efficient implementation of the network simplex method. Mathematical Programming Study 26 (1986) 83-111
29. Schechter M., and Steuer R.E. A correction to the connectedness of the Evans-Steuer algorithm of multiple objective linear programming. Foundations of Computing & Decision Sciences 30 4 (2005) 351-359
30. Klingman D., Napier A., and Stutz J. NETGEN: a program for generating large scale capacitated assignment, transportation, and minimum cost flow network problems. Management Science 20 5 (1974) 814-821
31. Coffin M., and Saltzman M.J. Statistical analysis of computational tests of algorithms and heuristics. INFORMS Journal on Computing 12 1 (2000) 24-44
32. SPSS. SPSS Statistics 17.0 for Microsoft Windows.
33. Raith A, Ehrgott M. A two-phase algorithm for the biobjective integer minimum cost flow problem. Computers and Operations Research (2008), in press, doi:10.1016/j.cor.2008.06.008.