The procedure specializes to published procedures of Murty and of Yen for the assignment problem and the shortest path problem, respectively. A method is presented for reducing the required amount of ...

It is particularly applicable in transportation network design problems where the trade-off between operator costs and user costs is important. An algorithm is presented to identify noninferior ...

A canonical problem in computer science is to find the shortest route to every point in a network. A new approach beats the classic algorithm taught in textbooks.