Managing Redundancy in Distributed Computer Networks: A State Transition Graph Approach for the Stashing Problem

DOI10.1287/opre.46.3.305zbMath0987.68509OpenAlexW2108796128MaRDI QIDQ2781092

Brian H. Walker, Brunilde Sansó

Publication date: 18 March 2002

Published in: Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

Steiner tree problems

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Combinatorial optimization (90C27) Distributed systems (68M14)

Related Items

The dynamic predicate stashing copy problem and the Steiner problem in graphs