Adaptive Routing on the Plane

DOI10.1287/OPRE.44.5.823MaRDI QIDQ4345603zbMATH OpenOpenAlexFDO

Authors Leandros Tassiulas

Publication date 23 July 1997

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.44.5.823

zbMATH Keywords

maximum throughputrouting

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Queues and service in operations research (90B22)

Recommendations

• scientific article; zbMATH DE number 4059093
• Open-loop routing of N arrivals to M parallel queues
• Serving requests with on-line routing
• ON A ROUTING PROBLEM
• Routing Jobs to Servers with Deterministic Service Times

Cited in

(7)

• Two queues with non-stochastic arrivals
• Stochastic dynamic vehicle routing in the light of prescriptive analytics: a review
• Controlled mobility in stochastic and dynamic wireless networks
• An optimal adaptive routing algorithm
• Solving large-scale dynamic vehicle routing problems with stochastic requests
• Dynamic parcel pick-up routing problem with prioritized customers and constrained capacity via lower-bound-based rollout approach
• A dynamic and stochastic cumulative capacitated vehicle routing problem

This page was built for publication: Adaptive Routing on the Plane

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