Multi-depot traveling salesmen location problems on networks with special structure
From MaRDI portal
Publication:2178369
DOI10.1007/s10479-018-2812-4zbMath1437.90092OpenAlexW2791882727WikidataQ130119159 ScholiaQ130119159MaRDI QIDQ2178369
Publication date: 11 May 2020
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-018-2812-4
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Cites Work
- Unnamed Item
- Inverse \(k\)-centrum problem on trees with variable vertex weights
- Location-routing: issues, models and methods
- Multiple sink location problems in dynamic path networks
- \((r,p)\)-centroid problems on paths and trees
- Minisum location of a travelling salesman on simple networks
- Structured \(p\)-facility location problems on the line solvable in polynomial time
- A taxonomical analysis, current methods and objectives on location-routing problems
- Optimal locations and districts of two traveling salesmen on a tree
- Minisum location of a traveling salesman
- A Heuristic Algorithm for the Traveling Salesman Location Problem on Networks
- Probabilistic a priori routing-location problems
- Minisum multipurpose trip location problem on trees
- The pickup delivery location problem on networks
- Probabilistic Sales-Delivery Man and Sales-Delivery Facility Location Problems on a Tree
This page was built for publication: Multi-depot traveling salesmen location problems on networks with special structure