Minisum location of a travelling salesman on simple networks
DOI10.1016/0377-2217(88)90430-4zbMATH Open0652.90096OpenAlexW1985890841MaRDI QIDQ1107451FDOQ1107451
Authors: Oded Berman, David Simchi-Levi
Publication date: 1988
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(88)90430-4
Recommendations
- Minisum location of a traveling salesman
- A Heuristic Algorithm for the Traveling Salesman Location Problem on Networks
- The Traveling Salesman Location Problem on Stochastic Networks
- Minmax \(p\)-traveling salesmen location problems on a tree
- Multi-depot traveling salesmen location problems on networks with special structure
minisum location1-tree networkscactus networksexpected distance trevelledoptimal home locationunicycle networks
Programming involving graphs or networks (90C35) Inventory, storage, reservoirs (90B05) Graph theory (05C99)
Cites Work
Cited In (8)
- A taxonomical analysis, current methods and objectives on location-routing problems
- The maximin-maxisum network location problem
- Locating a cycle in a transportation or a telecommunications network
- The transfer point location problem
- Minisum location of a travelling salesman on simple networks
- Minisum location of a traveling salesman
- Multi-depot traveling salesmen location problems on networks with special structure
- The Traveling Salesman Location Problem on Stochastic Networks
This page was built for publication: Minisum location of a travelling salesman on simple networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1107451)