Accumulation Point Location on Tree Networks for Guaranteed Time Distribution

DOI10.1287/MNSC.36.8.958MaRDI QIDQ3204319zbMATH OpenOpenAlexFDO

Authors H. Donald Ratliff, Ananth Iyer

Publication date 1990

Published in Management Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/mnsc.36.8.958

zbMATH Keywords

polynomial time algorithmsnetwork locationlocal centersguaranteed time distribution systemlocation of accumulation points

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)

Recommendations

• Reliable maximin-maxisum locations for maximum service availability on tree networks vulnerable to disruptions
• The stochastic location-assignment problem on a tree
• Two classes of location problems on tree networks
• Optimal location of interconnected facilities on tree networks subject to distance constraints
• On locating path- or tree-shaped facilities on networks
• An axiomatic characterization of a class of locations in tree networks
• Publication:4493169
• scientific article; zbMATH DE number 1323027
• On the location of a constrained \(k\)-tree facility in a tree network with unreliable edges

Cited in

(7)

• The \(p\)-hub center allocation problem
• Hub location problems: the location of interacting facilities
• Network design for time‐constrained delivery
• LTL logistics networks with differentiated services
• Network hub location problems: The state of the art
• An O\((nm)\) algorithm for a special case of the multimedian location problem on a tree
• Multiobjective multiproduct parcel distribution timetabling: a real-world application

This page was built for publication: Accumulation Point Location on Tree Networks for Guaranteed Time Distribution

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