Restricted delivery problems on a network

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0037(199707)29:4<205::AID-NET3>3.0.CO;2-J" /><205::AID-NET3>3.0.CO;2-J 10.1002/(SICI)1097-0037(199707)29:4<205::AID-NET3>3.0.CO;2-JzbMath0882.90030OpenAlexW2035807812MaRDI QIDQ4347274

Limor Klein, Esther M. Arkin, Refael Hassin

Publication date: 7 August 1997

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199707)29:4<205::aid-net3>3.0.co;2-j

zbMATH Keywords

approximation algorithmclustered traveling salesmandelivery problem on a networkshortest delivery routevehicle of infinite capacity

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06)

Related Items (15)

On residual approximation in solution extension problems ⋮ Approximation Algorithms for Not Necessarily Disjoint Clustered TSP ⋮ GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem ⋮ Vertices removal for feasibility of clustered spanning trees ⋮ An approximation algorithm for the clustered path travelling salesman problem ⋮ Approximation algorithms for the min-max clustered \(k\)-traveling salesmen problems ⋮ An approximation algorithm for the clustered path travelling salesman problem ⋮ On Residual Approximation in Solution Extension Problems ⋮ Achieving feasibility for clustered traveling salesman problems using PQ‐trees ⋮ Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries ⋮ The traveling salesman problem with flexible coloring ⋮ Approximation algorithms for general cluster routing problem ⋮ The preemptive swapping problem on a tree ⋮ Approximation algorithms with constant ratio for general cluster routing problems ⋮ A \(\frac{5}{3}\)-approximation algorithm for the clusterd traveling salesman tour and path problems

This page was built for publication: Restricted delivery problems on a network