Efficient solutions for the bicriteria network flow problem

[1]  T. L. Saaty,et al.  The computational algorithm for the parametric objective function , 1955 .

[2]  Ralph E. Steuer,et al.  A revised simplex method for linear multiple objective programs , 1973, Math. Program..

[3]  Darwin Klingman,et al.  NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems , 1974 .

[4]  Heinz Isermann,et al.  Technical Note - Proper Efficiency and the Linear Vector Maximum Problem , 1974, Oper. Res..

[5]  Joseph G. Ecker,et al.  Finding efficient points for linear multiple objective programs , 1975, Math. Program..

[6]  P. Yu,et al.  The set of all nondominated solutions in linear cases and a multicriteria simplex method , 1975 .

[7]  Gerald L. Thompson,et al.  Determining Cost vs. Time Pareto-Optimal Frontiers in Multi-Modal Transportation Problems , 1977 .

[8]  T. Gal.  A general method for determining the set of all efficient solutions to a linear vectormaximum problem , 1977 .

[9]  Hanif D. Sherali,et al.  Linear Programming and Network Flows , 1977 .

[10]  Heinz Isermann,et al.  The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program , 1977 .

[11]  Joseph G. Ecker,et al.  Finding all efficient extreme points for multiple objective linear programs , 1978, Math. Program..

[12]  W. H. Cunningham,et al.  Theoretical Properties of the Network Simplex Method , 1979, Math. Oper. Res..

[13]  D. Klingman,et al.  Solution Approaches for Network Flow Problems with Multiple Criteria , 1979 .

[14]  Y. Aneja,et al.  BICRITERIA TRANSPORTATION PROBLEM , 1979 .

[15]  H. Isermann.  The enumeration of all efficient solutions for a linear multiple-objective transportation problem , 1979 .

[16]  J. Ecker,et al.  Generating all maximal efficient faces for multiple objective linear programs , 1980 .

[17]  E. Martins,et al.  A bicriterion shortest path algorithm , 1982 .

[18]  D. J. White,et al.  The set of efficient solutions for multiple objective shortest path problems , 1982, Comput. Oper. Res..

[19]  S. Zionts,et al.  An Interactive Multiple Objective Linear Programming Method for a Class of Underlying Nonlinear Utility Functions , 1983 .

[20]  M. Delgado.  A resolution method for multiobjective problems , 1983 .

[21]  M. C. Puri,et al.  Bi-criteria network problem , 1984 .

[22]  D. J. White,et al.  A Special Multi-Objective Assignment Problem , 1984 .

[23]  E. Martins.  On a multicriteria shortest path problem , 1984 .

[24]  R. Rosenthal.  Concepts, Theory, and Techniques PRINCIPLES OF MULTIOBJECTIVE OPTIMIZATION* , 1985 .

[25]  J. Ringuest,et al.  Interactive solutions for the linear multiobjective transportation problem , 1987 .

[26]  Arthur Warburton,et al.  Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems , 1987, Oper. Res..

[27]  Donald Goldfarb,et al.  Anti-stalling pivot rules for the network simplex algorithm , 1990, Networks.

[28]  P. Simin Pulat,et al.  Bicriteria network flow problems: Continuous case , 1991 .

[29]  P. S. Pulat,et al.  Bicriteria network flow problems: Integer case , 1993 .