Restricted delivery problems on a network
DOI10.1002/(SICI)1097-0037(199707)29:4%3C205::AID-NET3%3E3.0.CO;2-JzbMATH Open0882.90030OpenAlexW2035807812MaRDI QIDQ4347274FDOQ4347274
Authors: Esther M. Arkin, Refael Hassin, Limor Klein
Publication date: 7 August 1997
Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199707)29:4%3C205::aid-net3%3E3.0.co;2-j
Recommendations
approximation algorithmclustered traveling salesmandelivery problem on a networkshortest delivery routevehicle of infinite capacity
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06)
Cited In (18)
- Approximation algorithms for not necessarily disjoint clustered TSP
- Achieving feasibility for clustered traveling salesman problems using PQ‐trees
- Approximation algorithms for the min-max clustered \(k\)-traveling salesmen problems
- On residual approximation in solution extension problems
- The traveling salesman problem with flexible coloring
- Generalized model of courier with additional restrictions
- Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries
- Vertices removal for feasibility of clustered spanning trees
- GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem
- On Residual Approximation in Solution Extension Problems
- The preemptive swapping problem on a tree
- A \(\frac{5}{3}\)-approximation algorithm for the clusterd traveling salesman tour and path problems
- Restricted connectivity for some interconnection networks
- An approximation algorithm for the clustered path travelling salesman problem
- An approximation algorithm for the clustered path travelling salesman problem
- Approximation algorithms with constant ratio for general cluster routing problems
- Title not available (Why is that?)
- Approximation algorithms for general cluster routing problem
This page was built for publication: Restricted delivery problems on a network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4347274)