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

Authors:
Ramesh Bollapragada;Jeffrey Camm;Uday S. Rao;Junying Wu
Affiliations:
College of Business, San Francisco State University, San Francisco, CA 94132, USA and Bell Laboratories, Lucent Technologies, Holmdel, NJ 07733, USA;QAOM Department, Lindner Hall, College of Business, University of Cincinnati, Cincinnati, OH 45221, USA;QAOM Department, Lindner Hall, College of Business, University of Cincinnati, Cincinnati, OH 45221, USA;QAOM Department, Lindner Hall, College of Business, University of Cincinnati, Cincinnati, OH 45221, USA
Venue:
Operations Research Letters
Year:
2005

Citing 8
Cited 2

A new approach to the maximum-flow problem

Journal of the ACM (JACM)
The maximal covering location problem with capacities on total workload

Management Science
The budgeted maximum coverage problem

Information Processing Letters
On Implementing Push-Relabel Method for the Maximum Flow Problem

Proceedings of the 4th International IPCO Conference on Integer Programming and Combinatorial Optimization
Spare-Capacity Assignment For Line Restoration Using a Single-Facility Type

Operations Research
Nature Reserve Site Selection to Maximize Expected Species Covered

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

INFORMS Journal on Computing
Near-optimal solutions to large-scale facility location problems

Discrete Optimization

A parallel evolutionary algorithm for the hub location problem with fully interconnected backbone and access networks

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Survey: Hub location problems: A review of models, classification, solution techniques, and applications

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study a two-phase, budget-constrained, network-planning problem with multiple hub types and demand scenarios. In each phase, we install (or move) capacitated hubs on selected buildings. We allocate hubs to realized demands, under technological constraints. We present a greedy algorithm to maximize expected demand covered and computationally study its performance.