Restricted delivery problems on a network

DOI10.1002/(SICI)1097-0037(199707)29:4%3C205::AID-NET3%3E3.0.CO;2-JMaRDI QIDQ4347274zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Recommendations

• k-delivery traveling salesman problem on tree networks
• The delivery man problem on a tree network
• Approximating Capacitated Routing and Delivery Problems
• Algorithms and Data Structures

Cited in

(21)

• A \(\frac{5}{3}\)-approximation algorithm for the clusterd traveling salesman tour and path problems
• On residual approximation in solution extension problems
• Approximation algorithms for general cluster routing problem
• Approximation algorithms with constant ratio for general cluster routing problems
• Vertices removal for feasibility of clustered spanning trees
• Approximation algorithms for the min-max clustered \(k\)-traveling salesmen problems
• scientific article; zbMATH DE number 1688368 (Why is no real title available?)
• Generalized model of courier with additional restrictions
• On Residual Approximation in Solution Extension Problems
• The preemptive swapping problem on a tree
• GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem
• The traveling salesman problem with flexible coloring
• Approximation algorithms for not necessarily disjoint clustered TSP
• Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries
• Restricted connectivity for some interconnection networks
• An approximation algorithm for the clustered path travelling salesman problem
• Achieving feasibility for clustered traveling salesman problems using PQ‐trees
• An approximation algorithm for the clustered path travelling salesman problem
• An approximation algorithm for the (metric) clustered path traveling salesman problem
• A strongly polynomial time approximation algorithm for the min-max clustered cycle cover problem
• Better approximation algorithms for clustered TSP and subgroup planning

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)