Locating mobile servers on a network with markovian properties

DOI10.1002/net.3230120106zbMath0478.90016OpenAlexW2016608526MaRDI QIDQ3936461

Amedeo R. Odoni, Oded Berman

Publication date: 1982

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230120106

zbMATH Keywords

heuristic algorithmmobile serverslocation of mobile serverslocation-relocation problemMarkovian state transitionoptimal location on a networkprobabilistic eventsstate changing network

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Integer programming (90C10) Queues and service in operations research (90B22) Deterministic network models in operations research (90B10) Inventory, storage, reservoirs (90B05)

Related Items (12)

Locations on time-varying networks ⋮ The multi-period \(p\)-center problem with time-dependent travel times ⋮ Resource Location and Relocation Models with Rolling Horizon Forecasting for Wildland Fire Planning ⋮ Developments in network location with mobile and congested facilities ⋮ A stochastic programming approach for Shelter location and evacuation planning ⋮ Relocation-promotion problem with Euclidean distance ⋮ Optimization of competitive facility location for chain stores ⋮ Evasive flow capture: a multi-period stochastic facility location problem with independent demand ⋮ Strategic facility location: A review ⋮ Median Problems in Networks ⋮ Dynamic facility location when the total number of facilities is uncertain: A decision analysis approach ⋮ Location of central nodes in time varying computer networks

This page was built for publication: Locating mobile servers on a network with markovian properties