Letter to the Editor—The kth Best Route Through a Network

DOI10.1287/opre.9.4.578zbMath0096.35403OpenAlexW2078279080MaRDI QIDQ3275354

Maurice Pollack

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

zbMATH Keywords

applications of probability theory and statistics

Related Items (8)

Heuristic search for one-to-many shortest path queries ⋮ Constructing the nearly shortest path in crossed cubes ⋮ Enumerating \(K\) best paths in length order in DAGs ⋮ Solutions of the kth best route through a network. A review ⋮ An efficient time and space \(K\) point-to-point shortest simple paths algorithm ⋮ Routing through a network with maximum reliability ⋮ On the \(K\) shortest path trees problem ⋮ A dynamic programming algorithm to find all solutions in a neighborhood of the optimum

This page was built for publication: Letter to the Editor—The kth Best Route Through a Network