Letter to the Editor—The kth Best Route Through a Network
From MaRDI portal
Publication:3275354
DOI10.1287/opre.9.4.578zbMath0096.35403MaRDI QIDQ3275354
Publication date: 1961
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.9.4.578
Related Items
An efficient time and space \(K\) point-to-point shortest simple paths algorithm, On the \(K\) shortest path trees problem, A dynamic programming algorithm to find all solutions in a neighborhood of the optimum, Solutions of the kth best route through a network. A review, Routing through a network with maximum reliability, Enumerating \(K\) best paths in length order in DAGs, Constructing the nearly shortest path in crossed cubes