Probabilistic Sales-Delivery Man and Sales-Delivery Facility Location Problems on a Tree

DOI10.1287/trsc.29.2.184zbMath0860.90058OpenAlexW2001415240MaRDI QIDQ5689146

Igor Averbakh, Oded Berman

Publication date: 6 January 1997

Published in: Transportation Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/trsc.29.2.184

zbMATH Keywords

polynomial algorithmsexpected total waiting timeoptimal home location for the server

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) Queues and service in operations research (90B22) Discrete location and assignment (90B80)

Related Items (9)

Distribution network design on the battlefield ⋮ A survey on combinatorial optimization in dynamic environments ⋮ Location-routing: issues, models and methods ⋮ A profit-maximization location-routing-pricing problem: a branch-and-price algorithm ⋮ Multi-depot traveling salesmen location problems on networks with special structure ⋮ The probabilistic uncapacitated open vehicle routing location problem ⋮ Ordered weighted average optimization in multiobjective spanning tree problem ⋮ Combined location-routing problems: A synthesis and future research directions ⋮ A taxonomical analysis, current methods and objectives on location-routing problems

This page was built for publication: Probabilistic Sales-Delivery Man and Sales-Delivery Facility Location Problems on a Tree