메뉴 건너뛰기




Volumn 158, Issue , 2011, Pages 101-125

Mathematical programming models for third generation wireless network design

Author keywords

[No Author keywords available]

Indexed keywords


EID: 84975784474     PISSN: 08848289     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-1-4419-6111-2_5     Document Type: Article
Times cited : (4)

References (57)
  • 7
    • 3042762352 scopus 로고    scopus 로고
    • Planning UMTS base station location: Optimization models with power control algorithms
    • Amaldi, E., Capone, A., Malucelli, F.: Planning UMTS base station location: Optimization models with power control algorithms. IEEE Transactions on Wireless Communications 2, 939-952 (2003)
    • (2003) IEEE Transactions on Wireless Communications , vol.2 , pp. 939-952
    • Amaldi, E.1    Capone, A.2    Malucelli, F.3
  • 8
    • 4143060315 scopus 로고    scopus 로고
    • A mathematical programming approach for W-CDMA radio planning with uplink and downlink constraints
    • IEEE
    • Amaldi, E., Capone, A., Malucelli, F., Signori, F.: A mathematical programming approach for W-CDMA radio planning with uplink and downlink constraints. In: IEEE 58th Vehicular Technology Conference Proceedings, vol. 2, pp. 806-810. IEEE (2003)
    • (2003) IEEE 58th Vehicular Technology Conference Proceedings , vol.2 , pp. 806-810
    • Amaldi, E.1    Capone, A.2    Malucelli, F.3    Signori, F.4
  • 10
    • 0242458670 scopus 로고    scopus 로고
    • On the complexity of a class of combinatorial optimization problems with uncertainty
    • Averbakh, I.: On the complexity of a class of combinatorial optimization problems with uncertainty. Mathematical Programming Series A 90, 263-272 (2001)
    • (2001) Mathematical Programming Series A , vol.90 , pp. 263-272
    • Averbakh, I.1
  • 12
    • 0442266090 scopus 로고    scopus 로고
    • Robust solutions of linear programming problems contaminated with uncertain data
    • Ben-Tal, A., Nemirovski, A.: Robust solutions of linear programming problems contaminated with uncertain data. Mathematical Programming Series A 88, 411-424 (2000)
    • (2000) Mathematical Programming Series A , vol.88 , pp. 411-424
    • Ben-Tal, A.1    Nemirovski, A.2
  • 16
    • 84975675761 scopus 로고    scopus 로고
    • Tech. Rep., Department of Engineering Management, Information, and Systems, Bobby B. Lyle School of Engineering, Southern Methodist University, Dallas, TX
    • Cai, Q., Kalvenes, J., Kennington, J., Olinick, E.: Reliable W-CDMA network design. Tech. Rep., Department of Engineering Management, Information, and Systems, Bobby B. Lyle School of Engineering, Southern Methodist University, Dallas, TX (2006). http://lyle.smu.edu/ jlk/cdmarely.pdf
    • (2006) Reliable W-CDMA network design
    • Cai, Q.1    Kalvenes, J.2    Kennington, J.3    Olinick, E.4
  • 19
    • 84943276526 scopus 로고    scopus 로고
    • Tech. Rep. 14-2009, Department of Computer and System Sciences, Sapienza Università di Roma
    • D'Andreagiovanni, F., Mannino, C., Sassano, A.: A power-indexed formulation for wireless network design. Tech. Rep. 14-2009, Department of Computer and System Sciences, Sapienza Università di Roma (2009). http://ojs.uniroma1.it/index.php/DIS TechnicalReports/article/viewFile/8855/8826
    • (2009) A power-indexed formulation for wireless network design
    • D' Andreagiovanni, F.1    Mannino, C.2    Sassano, A.3
  • 23
    • 84975691613 scopus 로고    scopus 로고
    • Accessed on June 14, 2010
    • FCC: Construction/coverage requirements. http://wireless.fcc.gov/licensing/index.htm? job=const req by service. Accessed on June 14, 2010
    • Construction/coverage requirements
    • FCC1
  • 24
    • 0034313847 scopus 로고    scopus 로고
    • Solving the two-connected network with bounded meshes problem
    • Fortz, B., Labbé, M., Maffioli, F.: Solving the two-connected network with bounded meshes problem. Operations Research 48, 866-877 (2000)
    • (2000) Operations Research , vol.48 , pp. 866-877
    • Fortz, B.1    Labbé, M.2    Maffioli, F.3
  • 26
    • 0000411214 scopus 로고
    • Tabu search, Part I
    • Glover, F.: Tabu search, Part I. ORSA Journal on Computing 1(3), 190-206 (1989)
    • (1989) ORSA Journal on Computing , vol.1 , Issue.3 , pp. 190-206
    • Glover, F.1
  • 27
    • 0001724713 scopus 로고
    • Tabu search, Part II
    • Glover, F.: Tabu search, Part II. ORSA Journal on Computing 2(1), 4-32 (1990)
    • (1990) ORSA Journal on Computing , vol.2 , Issue.1 , pp. 4-32
    • Glover, F.1
  • 28
    • 0001621683 scopus 로고
    • Computational results with a cutting plane algorithm for designing communication networks with low-connectivity constraints
    • Grötschel, M., Monma, C., Stoer, M.: Computational results with a cutting plane algorithm for designing communication networks with low-connectivity constraints. Operations Research 40, 309-330 (1992)
    • (1992) Operations Research , vol.40 , pp. 309-330
    • Grötschel, M.1    Monma, C.2    Stoer, M.3
  • 29
    • 77957077046 scopus 로고
    • Design of survivable networks
    • chap. 10, North-Holland, Amsterdam, The Netherlands
    • Grötschel, M., Monma, C., Stoer, M.: Design of survivable networks. In: Handbooks in OR/MS, vol. 8, chap. 10, pp. 617-672. North-Holland, Amsterdam, The Netherlands (1995)
    • (1995) Handbooks in OR/MS , vol.8 , pp. 617-672
    • Grötschel, M.1    Monma, C.2    Stoer, M.3
  • 30
    • 56649083852 scopus 로고    scopus 로고
    • Network planning in uncertain dynamic environments
    • 9th International Telecommunication Network Planning Symposium
    • Gryseels, M., Sorbello, L., Demeester, P.: Network planning in uncertain dynamic environments. In: Networks 2000, 9th International Telecommunication Network Planning Symposium (2000).
    • (2000) Networks 2000
    • Gryseels, M.1    Sorbello, L.2    Demeester, P.3
  • 31
    • 0019045740 scopus 로고
    • Empirical formula for propagation loss in land mobile radio service
    • Hata, M.: Empirical formula for propagation loss in land mobile radio service. IEEE Transactions on Vehicular Technology 29, 317-325 (1980)
    • (1980) IEEE Transactions on Vehicular Technology , vol.29 , pp. 317-325
    • Hata, M.1
  • 32
    • 24144487043 scopus 로고    scopus 로고
    • Application of tabu search strategy for finding low energy structure of protien
    • J. Blazewicz, P.L., Milostan, M.: Application of tabu search strategy for finding low energy structure of protien. Artificial Intelligence in Medicine 35, 135-145 (2005)
    • (2005) Artificial Intelligence in Medicine , vol.35 , pp. 135-145
    • Blazewicz, J.P.L.1    Milostan, M.2
  • 34
    • 33748541249 scopus 로고    scopus 로고
    • Base station location and service assignments in W-CDMA networks
    • Kalvenes, J., Kennington, J., Olinick, E.: Base station location and service assignments in W-CDMA networks. INFORMS Journal on Computing 18(3), 366-376 (2006)
    • (2006) INFORMS Journal on Computing , vol.18 , Issue.3 , pp. 366-376
    • Kalvenes, J.1    Kennington, J.2    Olinick, E.3
  • 36
    • 0002631049 scopus 로고    scopus 로고
    • Approximation algorithms for finding highly connected subgraphs
    • D. Hochbaum (ed.), PWS Publishing Company, Boston, MA
    • Khuller, S.: Approximation algorithms for finding highly connected subgraphs. In: D. Hochbaum (ed.) Approximation Algorithms for NP-Hard Problems, pp. 236-265. PWS Publishing Company, Boston, MA (1997)
    • (1997) Approximation Algorithms for NP-Hard Problems , pp. 236-265
    • Khuller, S.1
  • 38
    • 0032208369 scopus 로고    scopus 로고
    • Applying robust optimization to capacity expansion of one location in telecommunications with demand uncertainty
    • Laguna, M.: Applying robust optimization to capacity expansion of one location in telecommunications with demand uncertainty. Management Science 44, 5101-5110 (1998)
    • (1998) Management Science , vol.44 , pp. 5101-5110
    • Laguna, M.1
  • 42
    • 0034486529 scopus 로고    scopus 로고
    • Optimum positioning of base stations for cellular radio networks
    • Mathar, R., Niessen, T.: Optimum positioning of base stations for cellular radio networks. Wireless Networks 6, 421-428 (2000)
    • (2000) Wireless Networks , vol.6 , pp. 421-428
    • Mathar, R.1    Niessen, T.2
  • 46
    • 0002456462 scopus 로고    scopus 로고
    • Frequency assignment problems
    • D. Zu, P. Pardalos (eds.), Kluwer Academic Publishers
    • Murphey, R., Pardalos, P., Resende, G.: Frequency assignment problems. In: D. Zu, P. Pardalos (eds.) Handbook of Combinatorial Optimization, pp. 1-55. Kluwer Academic Publishers (1999)
    • (1999) Handbook of Combinatorial Optimization , pp. 1-55
    • Murphey, R.1    Pardalos, P.2    Resende, G.3
  • 48
    • 35348966239 scopus 로고    scopus 로고
    • Optimizing revenue in CDMA networks under demand uncertainty
    • Olinick, E., Rosenberger, J.: Optimizing revenue in CDMA networks under demand uncertainty. European Journal of Operational Research 186(2), 812 - 825 (2008).
    • (2008) European Journal of Operational Research , vol.186 , Issue.2 , pp. 812-825
    • Olinick, E.1    Rosenberger, J.2
  • 52
    • 33847757826 scopus 로고    scopus 로고
    • Robust tower location for code devision multiple access networks
    • Rosenberger, J., Olinick, E.: Robust tower location for code devision multiple access networks. Naval Research Logistics 54(2), 151-161 (2007)
    • (2007) Naval Research Logistics , vol.54 , Issue.2 , pp. 151-161
    • Rosenberger, J.1    Olinick, E.2
  • 55
    • 33746593347 scopus 로고    scopus 로고
    • Uplink UMTS network design-an integrated approach
    • St-Hilaire, M., Chamberland, S., Pierre, S.: Uplink UMTS network design-an integrated approach. Computer Networks 50, 2747-2761 (2006)
    • (2006) Computer Networks , vol.50 , pp. 2747-2761
    • St-Hilaire, M.1    Chamberland, S.2    Pierre, S.3
  • 57
    • 0029375832 scopus 로고
    • A framework for uplink power control in cellular radio systems
    • Yates, R.: A framework for uplink power control in cellular radio systems. IEEE Journal on Select Areas in Communications 13, 1341-1348 (1995)
    • (1995) IEEE Journal on Select Areas in Communications , vol.13 , pp. 1341-1348
    • Yates, R.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.