Location of central nodes in time varying computer networks

DOI10.1016/0167-6377(91)90031-JzbMath0734.90049MaRDI QIDQ811350

Raphael Rom, Ariel Orda

Publication date: 1991

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

zbMATH Keywords

continuous time domaindiscrete time domainsingle facility dynamic-network location

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Discrete location and assignment (90B80) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (3)

Locations on time-varying networks ⋮ Time traps in supply chains: is optimal still good enough? ⋮ Distributed shortest-path protocols for time-dependent networks

Cites Work

• Unnamed Item
• Distributed network protocols
• Shortest-path algorithms: Taxonomy and annotation
• Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
• State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems
• State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure
• Locating mobile servers on a network with markovian properties
• The Multiperiod Location-Allocation Problem with Relocation of Facilities
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph

This page was built for publication: Location of central nodes in time varying computer networks