A parametric approach to solving bicriterion shortest path problems

[1]  Harry Katzan.  Distributed Information Systems , 1979, Encyclopedia of GIS.

[2]  Rajan Batta,et al.  Optimal Obnoxious Paths on a Network: Transportation of Hazardous Materials , 1988, Oper. Res..

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

[4]  M. I. Henig.  The shortest path problem with two objective functions , 1986 .

[5]  Narsingh Deo,et al.  Shortest-path algorithms: Taxonomy and annotation , 1984, Networks.

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

[7]  Gülseren Kiziltan,et al.  An algorithm for bicriterion linear programming , 1982 .

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

[9]  John Christopher Robbins,et al.  Routing hazardous materials shipments , 1981 .

[10]  Pierre Hansen,et al.  Bicriterion Path Problems , 1980 .

[11]  F. Glover,et al.  A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees , 1979, Networks.

[12]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[13]  M. Zeleny,et al.  Linear Multiparametric Programming by Multicriteria Simplex Method , 1976 .

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

[15]  J. Y. Yen.  Finding the K Shortest Loopless Paths in a Network , 1971 .

[16]  Arthur M. Geoffrion,et al.  Solving Bicriterion Mathematical Programs , 1967, Oper. Res..

[17]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[18]  Richard Bellman,et al.  ON A ROUTING PROBLEM , 1958 .

[19]  L. R. Ford,et al.  NETWORK FLOW THEORY , 1956 .