Solutions of the kth best route through a network. A review

DOI10.1016/0022-247X(61)90076-2zbMath0112.12105OpenAlexW2043779727MaRDI QIDQ1131452

Maurice Pollack

Publication date: 1961

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-247x(61)90076-2

zbMATH Keywords

applications of probability theory and statistics

Related Items (6)

The Kth TSP is pseudopolynomial when TSP is polynomial ⋮ Flexible guidepath design for automated guided vehicle systems ⋮ A combinatorial ranking problem ⋮ The multiple shortest path problem with path deconfliction ⋮ The shortest route problem with constraints ⋮ A dynamic programming algorithm to find all solutions in a neighborhood of the optimum

Cites Work

• Solutions of the Shortest-Route Problem—A Review
• Onkth Best Policies
• Letter to the Editor—The kth Best Route Through a Network
• A Method for the Solution of the N th Best Path Problem

This page was built for publication: Solutions of the kth best route through a network. A review