A two-phase algorithm for the biobjective integer minimum cost flow problem

Computers and Operations Research

Volumn 36, Issue 6, 2009, Pages 1945-1954

  Raith, Andrea ^a   Ehrgott, Matthias ^a,b  

^a UNIVERSITY OF AUCKLAND   (New Zealand)

^b UNIVERSITÉ DE NANTES   (France)

Author keywords

Biobjective integer minimum cost flow problem; k best flow algorithm; Two phase method

Indexed keywords

COST ACCOUNTING;

BIOBJECTIVE INTEGER MINIMUM COST FLOW PROBLEM; COMPLETE SETS; EFFICIENT SOLUTIONS; EXTREME POINTS; FLOW ALGORITHMS; GRID STRUCTURES; IN PHASE; K BEST FLOW ALGORITHM; MINIMUM COST FLOW PROBLEMS; PARAMETRIC NETWORKS; PHASE METHODS; PROBLEM INSTANCES; SIMPLEX ALGORITHMS; TWO PHASE METHOD; WEIGHTED SUMS;

ALGORITHMS;

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

References (28)

1. Ahuja R.K., Magnanti T.L., and Orlin J.B. Network flows: theory, algorithms, and applications (1993), Prentice Hall, Engelwood cliffs, NJ
2. Ruhe G. Complexity results for multicriteria and parametric network flows using a pathological graph of Zadeh. Zeitschrift für Operations Research 32 (1988) 9-27
3. Serafini P. Some considerations about computational complexity for multi-objective combinatorial problems. In: Jahn J, Krabs W, editors. Recent advances and historical development of vector optimization, Lecture Notes in Economics and Mathematical Systems, vol. 294. Berlin: Springer; 1986. p. 222-32.
4. 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
5. Hamacher H.W. A note on k best network flows. Annals of Operations Research 57 (1995) 65-72
6. 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
7. Lee H., and Pulat P.S. Bicriteria network flow problems. European Journal of Operational Research 51 (1991) 1190126
8. Pulat P.S., Huarng F., and Lee H. Efficient solutions for the bicriteria network flow problem. European Journal of Operational Research 19 7 (1992) 649-655
9. 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
10. Eusébio A, Figueira JR. Why is difficult to find non-dominated solutions in bi-criteria network flow problems when using simplex based methods? Technical report, Instituto Superior Técnico, Portugal; 2006.
11. Lee H., and Pulat P.S. Bicriteria network flow problems: integer case. European Journal of Operational Research 66 1 (1993) 148-157
12. 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, Taipei, Taiwan, vol. 3, 1992; p. 305-18.
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 2 (2001) 139-156
14. 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
15. Figueira JR. On the integer bi-criteria network flow problem: a branch-and-bound approach. Technical report, Cahier du LAMSADE no 191, Université Paris-Dauphine, 2002.
16. Eusébio A, Figueira JR. A note on the computation of supported non-dominated solutions for bi-criteria network flow problems. Technical report Working Paper N.2/2007. Instituto Superior Técnico, Portugal; 2007.
17. Ulungu E.L., and Teghem J. The two phases method: an efficient procedure to solve bi-objective combinatorial optimization problems. Foundations of Computing and Decision Sciences 20 2 (1995) 149-165
18. Helgason RV, Kennington JL. Handbooks in operations research and management science. Primal simplex algorithms for minimum cost network flow, vol. 7. Amsterdam: Elsevier; 1995. p. 85-133.
19. Sedeño-Noda A., González-Martín C., and Gutiérrez J. The biobjective undirected two-commodity minimum cost flow problem. European Journal of Operational Research 164 (2005) 89-103
20. Dantzig G.B., and Thapa M.N. Linear programming 2: theory and extensions. Springer Series in Operations Research (1997), Springer, Berlin
21. Isermann H. Proper efficiency and the linear vector maximum problem. Operations Research 22 (1974) 189-191
22. Löbel A. MCF version 1.3-a network simplex implementation. Available for academic use free of charge via WWW at 〈http://www.zib.de/Optimization/Software/Mcf/〉, 2004.
23. Cunningham W.H. A network simplex method. Mathematical Programming 11 (1976) 105-116
24. Przybylski A., Gandibleux X., and Ehrgott M. Two-phase algorithms for the bi-objective assignment problem. European Journal of Operational Research 185 2 (2008) 509-533
25. Raith A, Ehrgott M. A comparison of solution strategies for biobjective shortest path problems. Computers & Operations Research 2008; doi:10.1016/j.cor.2008.02.002.
26. Klingman D., Napier A., and Stutz J. NETGEN: a program for generating large scale assignment, transportation, and minimum cost flow problems. Management Science 20 (1974) 814-821
27. Przybylski A, Gandibleux X, Ehrgott M. A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives. Technical report, LINA, Université de Nantes; 2007.
28. Figueira, JR. On the integer bi-criteria network flow problem: a branch-and-bound approach. Technical report, Faculdade de Economia Universidade de Coimbra, Portugal, 2000. Working Paper N.3/2000.