Abstract
Bicriterion path problems in directed graphs are systematically studied. A series of ten problems are defined and their computational complexity examined. Algorithms are provided for some of them, including polynomial algorithms for the MAXMIN-MAXMIN problem and the MINSUM-MAXMIN problem, and a pseudo-polynomial exact algorithm as well as a fully polynomial approximation scheme for the MINSUM-MINSUM problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Amara, R.C., Lindgren, H. and M. Pollack, “Link Error Control and Network Route Selection”, IRE Trane. Commun. Systems, CS-9, 328–334, 1961.
Aneja, Y.P. and K.P.K. Nair, “The Constrained Shortest Path Problem”, Naval Research Logistics Quarterly, 25, 549–555, 1978.
Berge, C., “Graphes et hypergraphes”, Paris: Dunod, 1970, English translation Amsterdam: North-Holland, 1973.
Dykstra, E.W., “A Note on Two Problems in Connexion with Graphs”, Numerische Mathematik, 1, 269–271, 1959.
Ford, L.R. Jr., Network Flow Theory, The Rand Corporation, Paper P-923, July 1956.
Frank, H. and I.T. Frisch, “Communication, Transmission and Transportation Networks”, Reading, Massachusetts: Addison — Wesley, 1971.
Frisch, I.T. “Optimum Routes in Communication Systems with Channel Capacities and Channel Reliabilities”, IEEE Trans. Commun. Systems CS-11, 241–244, 1963.
Garey, M. and D.S. Johnson, “Computers and Intractability: A Guide to the Theory of NP-Completeness”, San Francisco: Freeman, 1979.
Hansen, P., “An 0(m log D) Algorithm for Shortest Paths”, Discrete Applied Mathematics (forthcoming).
Hardgrave, W.W. and G.L. Nemhauser, “On the Relation Between the Traveling Salesman and the Longest Path Problems”, Operations Research, 10, 647–657 (1962).
Lawler, E., “Combinatorial Optimization, Network and Matroids”, New York: Holt, Rinehart and Winston, 1976.
Marchet, J.C. and J. Siskos, “Aide à la décision en matière d’envi-ronnement: Application au choix de tracé autoroutier”, Rapport LAMSADE, 23-1979, Université de Paris Dauphine.
Megiddo, N. p. 214 in [7].
Moore, H.M., “On the Fastest Route for Convoy-Type Traffic in Flowrate Constrained Networks”, Transportation Science, 10, 113–124, 1976.
Pandit, S.N.N., “Some Observations on the Longest Path Problem”, Operations Research, 12, 361–364, 1964.
Vincke, Ph., “Problèmes Multicritères”, Cahiers du Centre d’Etudes de Recherche Opérationnelle, 16, 425–439, 1974.
Wongseelashote. A., “Semirings and Path Spaces”, Discrete Mathematics, 26, 55–78, 1979.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1980 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hansen, P. (1980). Bicriterion Path Problems. In: Fandel, G., Gal, T. (eds) Multiple Criteria Decision Making Theory and Application. Lecture Notes in Economics and Mathematical Systems, vol 177. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-48782-8_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-48782-8_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-09963-5
Online ISBN: 978-3-642-48782-8
eBook Packages: Springer Book Archive