Serviceeinschränkungen vom 12.-22.02.2026 - weitere Infos auf der UB-Homepage
American Psychological Association 6th edition

Byers, T. H., & Waterman, M. S. (1984). Determining All Optimal and Near-Optimal Solutions when Solving Shortest Path Problems by Dynamic Programming. Operations Research, 32(6), 1381-1384. https://doi.org/10.1287/opre.32.6.1381

ISO-690 (author-date, English)

BYERS, Thomas H. und WATERMAN, Michael S., 1984. Determining All Optimal and Near-Optimal Solutions when Solving Shortest Path Problems by Dynamic Programming. Operations Research. 1 November 1984. Vol. 32, no. 6, p. 1381-1384. DOI 10.1287/opre.32.6.1381.

Modern Language Association 9th edition

Byers, T. H., und M. S. Waterman. „Determining All Optimal and Near-Optimal Solutions When Solving Shortest Path Problems by Dynamic Programming.“. Operations Research, Bd. 32, Nr. 6, November 1984, S. 1381-4, https://doi.org/10.1287/opre.32.6.1381.

Mohr Siebeck - Recht (Deutsch - Österreich)

Byers, Thomas H./Waterman, Michael S.: Determining All Optimal and Near-Optimal Solutions when Solving Shortest Path Problems by Dynamic Programming., Operations Research 1984, 1381-1384.

Emerald - Harvard

Byers, T.H. und Waterman, M.S. (1984), „Determining All Optimal and Near-Optimal Solutions when Solving Shortest Path Problems by Dynamic Programming.“, Operations Research, Vol. 32 No. 6, S. 1381-1384.

Achtung: Diese Zitate sind unter Umständen nicht zu 100% korrekt.