A Note on the Complexity of a Simple Transportation Problem
From MaRDI portal
Publication:4037683
DOI10.1137/0222005zbMath0767.68055OpenAlexW2078969731MaRDI QIDQ4037683
Publication date: 16 May 1993
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://docs.lib.purdue.edu/cgi/viewcontent.cgi?article=1688&context=cstech
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items (5)
Serving requests with on-line routing ⋮ How to sort by walking and swapping on paths and trees ⋮ Routing a vehicle of capacity greater than one ⋮ A hard dial-a-ride problem that is easy on average ⋮ Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks
This page was built for publication: A Note on the Complexity of a Simple Transportation Problem
