Minisum location of a traveling salesman
From MaRDI portal
Publication:3787763
DOI10.1002/net.3230160302zbMath0644.90031OpenAlexW1966162848MaRDI QIDQ3787763
David Simchi-Levi, Oded Berman
Publication date: 1986
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230160302
sensitivityoptimal locationminisum locationexpected length of a traveling salesman tourservice facility location on networkservice list
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Queues and service in operations research (90B22) Inventory, storage, reservoirs (90B05)
Related Items
Distribution network design on the battlefield ⋮ Heuristics and bounds for the travelling salesman location problem on the plane ⋮ Location-routing: issues, models and methods ⋮ Minisum location of a travelling salesman on simple networks ⋮ The transfer point location problem ⋮ Models and exact solutions for a class of stochastic location-routing problems ⋮ Multi-depot traveling salesmen location problems on networks with special structure ⋮ Location‐routing problem: a classification of recent research ⋮ The probabilistic uncapacitated open vehicle routing location problem ⋮ Solution approaches for the stochastic capacitated traveling salesmen location problem with recourse ⋮ A taxonomical analysis, current methods and objectives on location-routing problems
Cites Work
