Biobjective minimum cost flow problem

European Journal of Operational Research

Volumn 124, Issue 3, 2000, Pages 591-600

  Sedeno Noda A ^a   Gonzalez Martin C ^a  

^a UNIVERSIDAD DE LA LAGUNA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COSTS; DECISION THEORY; MATHEMATICAL PROGRAMMING;

BIOBJECTIVE MINIMUM COST FLOW PROBLEM; EFFICIENT EXTREME POINTS; NETWORK PROGRAMMING;

OPERATIONS RESEARCH;

EID: 0342572619     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(99)00191-5     Document Type: Article

References (21)

1. R. Ahuja, T. Magnanti, J.B. Orlin, Network Flows, Prentice-Hall, Englewood Cliffs, NJ, 1993.
2. Aneja Y.P., Nair K.P. Bicriteria transportation problem. Magnagement Science. 25(1):1979.
3. Bryson N. Parametric programming and lagrangian relaxation: The case of the network problem with a single side-constraint. Computers and Operations Research. 18(2):1991;129-140.
4. Calvete H.I., Mateo P.M. An approach for the network flow problem with multiple objectives. Computers and Operations Research. 22(9):1995;971-983.
5. Cunningham W.H. A network simplex method. Mathematical Programming. 11:1976;105-106.
6. Cunningham W.H. Theoretical properties of the network simplex method. Mathematics of Operations Research. 4:1979;196-208.
7. Gass S., Saaty T. The computational algorithm for the parametric objective function. Naval Research Logistics Quarterly. 2:1955;39-45.
8. T. Gal, Postoptimal Analyses, Parametric Programming and Related Topics, McGraw-Hill, New York, 1979.
9. Geoffrion A.M. Solving bicriterion mathematical programs. Operations Research. 15:1967;39-54.
10. Glover F., Karney D., Kligman D., Napier A. A computational study on star procedures, basis change criteria and solution algorithms for transportation problem. Management Science. 20:1974;793-813.
11. Goldfarb D., Hao J. Anti-stalling pivot rules for the network simplex algorithm. Networks. 20:1990;79-91.
12. Isermann H. The enumeration of all efficient solutions for a linear multiple-objective transportation problem. Naval Research Logistics Quarterly. 26:1979;123-139.
13. Klingman D., Napier A., Stutz J. NETGEN - a program for generating large scale (un) capacitated assignment, transportation and minimum cost flow network problems. Management Science. 20:1974;814-822.
14. Klingman D., Mote J. Solution approaches for network flow problems with multiple criteria. Advances in Management Studies. 1(1):1982;1-30.
15. Lee H., Pulat S. Bicriteria network flow problems: Continuous case. European Journal of Operational Research. 51:1991;119-126.
16. Malhotra R., Puri M.C. Bi-criteria network problem. cahiers du C.E.R.O. 26:1984;95-102.
17. Pulat P., Huarng F., Lee H. Efficient solutions for the bicriteria network flow problem. Computers and Operations Research. 19(7):1992;649-655.
18. Ringuest J.L., Rinks D.B. Interactive solutions for the linear multiobjective transportation problem. European Journal of Operational Research. 32:1987;96-106.
19. R.E. Steuer, Multiple-Criteria Optimization: Theory, Computation and Application, Wiley series in probability and mathematical statistics-applied, Wiley, New York, 1985.
20. P. Yu, Multiple-Criteria Decision Making, Plenum Press, New York, 1985.
21. Yu P., Zeleny M. Linear multiparametric programming by multicriteria simplex method. Management Science. 23(2):1976;159-170.