Sales‐delivery man problems on treelike networks

DOI10.1002/NET.3230250204MaRDI QIDQ4698228zbMATH OpenOpenAlexFDO

Authors Igor Averbakh, Oded Berman

Publication date 18 March 1996

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230250204

zbMATH Keywords

treespolynomial algorithmsdelivery man problemNP- completecactus networksmultiserver variants

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06)

Recommendations

• Probabilistic Sales-Delivery Man and Sales-Delivery Facility Location Problems on a Tree
• The delivery man problem on a tree network
• Technical Note—Routing and Location-Routing p-Delivery Men Problems on a Path
• The pickup delivery location problem on networks

Cites work

• P-Complete Approximation Problems

Cited in

(10)

• An approximability result of the multi-vehicle scheduling problem on a path with release and handling times
• Approximation algorithms for distance constrained vehicle routing problems
• A note on the traveling repairman problem
• 2-approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times.
• The delivery man problem on a tree network
• Minmax subtree cover problem on cacti
• Network design for time‐constrained delivery
• Search and delivery man problems: when are depth-first paths optimal?
• Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks
• A faster 2-approximation algorithm for the minmax p-traveling salesmen problem on a tree

This page was built for publication: Sales‐delivery man problems on treelike networks

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