Budget-Constrained, Capacitated Hub Location to Maximize Expected Demand Coverage in Fixed-Wireless Telecommunication Networks

DOI10.1287/ijoc.1050.0143zbMath1241.90022OpenAlexW2050199637MaRDI QIDQ2892299

Uday Rao, Ramesh Bollapragada, Yanjun Li

Publication date: 18 June 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.1050.0143

zbMATH Keywords

stochastic programmingtelecommunicationsgreedy approximationallocation networkbroadband accessfixed-wireless location

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Stochastic programming (90C15) Discrete location and assignment (90B80) Communication theory (94A05)

Related Items (6)

A conditional \(p\)-hub location problem with attraction functions ⋮ Benders decomposition applied to profit maximizing hub location problem with incomplete hub network ⋮ On a facility location problem with applications to tele-diagnostic ⋮ A specialized branch \& bound \& cut for single-allocation ordered median hub location problems ⋮ A two-phase greedy algorithm to locate and allocate hubs for fixed-wireless broadband access ⋮ Single-allocation ordered median hub location problems

This page was built for publication: Budget-Constrained, Capacitated Hub Location to Maximize Expected Demand Coverage in Fixed-Wireless Telecommunication Networks