The Routing Problem with “K” Specified Nodes
From MaRDI portal
Publication:5517432
DOI10.1287/opre.14.5.909zbMath0142.16803OpenAlexW2151842399MaRDI QIDQ5517432
Publication date: 1966
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.14.5.909
Related Items (7)
On the generalized 2-peripatetic salesman problem ⋮ New formulations for the elementary shortest-path problem visiting a given set of nodes ⋮ Irreversible operations — A network analysis ⋮ Some constrained shortest-route problems ⋮ A note on a single-shift days-off scheduling problem with sequence-dependent labor costs ⋮ A survey of dynamic network flows ⋮ The problem of maximum flow with minimum attainable cost in a network
This page was built for publication: The Routing Problem with “K” Specified Nodes
