Budget-Constrained, Capacitated Hub Location to Maximize Expected Demand Coverage in Fixed-Wireless Telecommunication Networks
Published Online:1 Nov 2006https://doi.org/10.1287/ijoc.1050.0143
References
- A decomposition algorithm for local access telecommunications network expansion planning. Oper. Res. (1995) 43:58–76Link, Google Scholar
- Spare-capacity assignment for line restoration using a single-facility type. Oper. Res. (2002) 50:617–635Link, Google Scholar
- Near-optimal solutions to large scale facility location problems. (1999) . IBM Research report, RC 21606, Computer Science/Mathematics, T. J. Watson Research Center, Yorktown Heights, New YorkGoogle Scholar
- The maximal expected covering location problem: Revisited. Transportation Sci. (1989) 23:277–287Link, Google Scholar
- An overview of representative problems in location research. Management Sci. (1989) 35:645–674Link, Google Scholar
- Recent applications of the maximal covering location planning (MCLP) model. J. Oper. Res. Soc. (1986) 37:735–746Crossref, Google Scholar
- Location of bank accounts to optimize float: An analytic study of exact and approximate algorithms. Management Sci. (1977) 23:789–810Link, Google Scholar
- Capacitated covering models. Environ. Planning B: Planning Design (1988) 15:153–163Crossref, Google Scholar
- A maximum expected covering location model: Formulation, properties and heuristic solution. Transportation Sci. (1983) 17:48–70Link, Google Scholar
- Network and Discrete Location: Models, Algorithms, and Applications (1995) (Wiley, New York) Crossref, Google Scholar
- Facility Location: A Survey of Applications and Methods (1995) (Springer-Verlag, Berlin, Germany) Crossref, Google Scholar
- Facility Location: Applications and Theory (2002) (Springer-Verlag, Berlin, Germany) Crossref, Google Scholar
- A threshold of ln(n) for approximating set cover. J. Association Comput. Mach. (1998) 45:634–652Crossref, Google Scholar
- Francis R. L., McGinnins L. F., White J. A.Facility Layout and Location: An Analytical Approach (1992) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
- Dynamic versions of set covering type public facility location problems. Eur. J. Oper. Res. (1982) 10:190–195Crossref, Google Scholar
- Classification of location models. Location Sci. (1998) 6:229–242Crossref, Google Scholar
- Approximation Algorithms for NP-hard Problems (1997) (PWS Publishing Company, Boston, MA) Google Scholar
- The budgeted maximum coverage problem. Inform. Processing Lett. (1999) 70:39–45Crossref, Google Scholar
- Hub location in backbone/tributary network design: A review. Location Sci. (1998) 6:307–335Crossref, Google Scholar
- Stochastic location analysis. Location Sci. (1993) 1:127–154Google Scholar
- Modeling and solving the two-facility capacitated network loading problem. Oper. Res. (1995) 43:142–157Link, Google Scholar
- Mirchandani P. B., Francis R. L.Discrete Location Theory (1990) (Wiley, New York) Google Scholar
- Network planning of broadband wireless networks. (2006) . Working paper, Bell Laboratories, Lucent Technologies, Holmdel, NJGoogle Scholar
- Newton’s Telecom Dictionary: Covering Telecommunications, Networking, Information Technology, Computing and the Internet (2004) 20th ed.(CMP Books, San Francisco, CA) Google Scholar
- The maximal covering location problem with capacities on total workload. Management Sci. (1991) 37:233–248Link, Google Scholar
- The plant location problem: New models and research prospects. Oper. Res. (1996) 44:864–874Link, Google Scholar
- Strategic facility planning: The analysis of options. Decision Sci. (1982) 13:1–14Crossref, Google Scholar

