Multi-depot traveling salesmen location problems on networks with special structure

DOI10.1007/S10479-018-2812-4zbMATH Open1437.90092OpenAlexW2791882727WikidataQ130119159 ScholiaQ130119159MaRDI QIDQ2178369FDOQ2178369

Authors: Igor Averbakh, Wei Yu 

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

Recommendations

• Generalized multiple depot traveling salesmen problem -- polyhedral study and exact algorithm
• A multi-depot travelling salesman problem and its iterative and integrated approaches
• The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations
• The Traveling Salesman Location Problem on Stochastic Networks
• A Lagrangian-based algorithm for a multiple depot, multiple traveling salesmen problem
• The Multi-Depot Routing Allocation Problem
• Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
• Heuristic solutions to multi-depot location-routing problems
• A 3/2-Approximation Algorithm for Multiple Depot Multiple Traveling Salesman Problem
• An extension of the Christofides heuristic for the generalized multiple depot multiple traveling salesmen problem

zbMATH Keywords

traveling salesmen location problemnetwork algorithmsprobabilistic location-routing

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)

Cites Work

• Network flows. Theory, algorithms, and applications.
• Location-routing: issues, models and methods
• Probabilistic a priori routing-location problems
• Inverse \(k\)-centrum problem on trees with variable vertex weights
• A Heuristic Algorithm for the Traveling Salesman Location Problem on Networks
• A taxonomical analysis, current methods and objectives on location-routing problems
• \((r,p)\)-centroid problems on paths and trees
• Structured \(p\)-facility location problems on the line solvable in polynomial time
• Minisum location of a traveling salesman
• The pickup delivery location problem on networks
• Multiple sink location problems in dynamic path networks
• Probabilistic Sales-Delivery Man and Sales-Delivery Facility Location Problems on a Tree
• Minisum location of a travelling salesman on simple networks
• Minisum multipurpose trip location problem on trees
• Optimal locations and districts of two traveling salesmen on a tree

Cited In (6)

• Minisum location of a travelling salesman on simple networks
• Minisum location of a traveling salesman
• Optimal locations and districts of two traveling salesmen on a tree
• The Traveling Salesman Location Problem on Stochastic Networks
• Generalized multiple depot traveling salesmen problem -- polyhedral study and exact algorithm
• The collection depots location problem on networks

This page was built for publication: Multi-depot traveling salesmen location problems on networks with special structure

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2178369)