A two-phase greedy algorithm to locate and allocate hubs for fixed-wireless broadband access

DOI10.1016/j.orl.2004.05.007zbMath1099.90011OpenAlexW1994531960MaRDI QIDQ2488215

Ramesh Bollapragada, Junying Wu, Uday Rao, Jeffrey D. Camm

Publication date: 25 August 2005

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

Full work available at URL: https://doi.org/10.1016/j.orl.2004.05.007

zbMATH Keywords

LocationStochastic programmingGreedy algorithmTelecommunicationsFixed-wireless

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Stochastic programming (90C15)

Related Items

Modeling congestion and service time in hub location problems

Cites Work

• Unnamed Item
• The budgeted maximum coverage problem
• Near-optimal solutions to large-scale facility location problems
• Budget-Constrained, Capacitated Hub Location to Maximize Expected Demand Coverage in Fixed-Wireless Telecommunication Networks
• The Maximal Expected Covering Location Problem: Revisited
• The Maximal Covering Location Problem with Capacities on Total Workload
• Spare-Capacity Assignment For Line Restoration Using a Single-Facility Type
• Nature Reserve Site Selection to Maximize Expected Species Covered
• A new approach to the maximum-flow problem
• The Plant Location Problem: New Models and Research Prospects
• A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning
• On implementing push-relabel method for the maximum flow problem