1 |
[1] 김은정, 강동한, 이경식, 박성수, '용량제약이 있는 이계층 설비 입지선정 문제의 최적화 해법', 한국경영과학회/대한산업공학회 춘계공동학술대회, 2003
|
2 |
차동완, 정승학, 명영수, '설비용량에 제한이 있는 입지선정 문제에 대한 기존해법간의 비교분석', 한국경영과학회지, 제11권, 제2호 (1986), pp.1-6
|
3 |
Balakrishnan, A., T. Magnanti, and P. Mirchandani, 'Network design:in annotated bibliographies in combinatorial optimization,' M. Dell'Amico, F. Mali and S. Martello(eds.), John Wiley and Sons, New York, 1997
|
4 |
Becchetti, L., J. Konemann, S. Leonardi, and M. Pal, 'Sharing the cost more efficiently: improved approximation for mul-ticommodity rent-or-buy problem,' Proceedings of the sixteenth annual ACMSIAM symposium on Discrete algorithms, 2005
|
5 |
Hao Q. et al., 'A low-cost cellular mobile communication system:a hierarchical optimization network resource planning approach,' IEEE JSAC, Vol.15, No.7(1997), pp. 1315-1326
|
6 |
Magnanti, T., P. Mirchandani, and R. Vachani, 'Modelling and solving the two-facility network loading problem,' Operations Research, Vol.43(1995), pp. 142-157
DOI
ScienceOn
|
7 |
조 건, '나무구조를 갖는 네트워크상에서의 제한용량이 있는 입지설정문제에 관한 연구', 대한산업공학회지, 제27권, 제3호(2001), pp.250-259
|
8 |
Andrews, M. and L. Zhang, 'The access network design problem,' Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, (1998), pp. 42-49
|
9 |
Shmoys, D.B., E. Tardos, and K. Aardal, 'Approximation algorithms for facility location problems,' Proceedings of the 29th Annual ACM Symposium on Theory of Computing, 1997
|
10 |
Bartal, Y., 'On approximating arbitrary metrics by tree metrics,' Proceedings of the 30th Annual ACM Symposium on Theory of Computing, 1998
|
11 |
Holma, H. and A. Toskala, WCDMA for UMTS, Revised Ed., John and Wiley & Sons, 2001
|
12 |
Garg, N., R. Khandekar, G. Konjevod, R. Ravi, F.S. Salman, and A. Sinha, 'On the integrality gap of a natural formulation of the single-sink buy-at-bulk network design problem,' Lecture Notes in Computer Science, Vol.2081(2001)
|
13 |
이창호, 윤종화, 정한욱, '설비용량을 고려한 계층적 네트워크의 설계 및 분석', 한국경영과학회지, 제19권, 제1호(1994), pp.69-83
|
14 |
Salman, F.S., J. Cheriyan, R. Ravi, and S. Subramanian, 'Buy at bulk network design:Approximating the single sink edge installation problem,' Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, 1997
|
15 |
Laiho, J., A. Wacker, and T. Novosad, Radio Network Planning and Optimization for UMTS, Wiley, 2002
|
16 |
Hassin, R., R. Ravi, and F.S. Salman, 'Approximation algorithms for a capacitated network design problem,' Lecture Notes in Computer Science, Vol.1913(2000)
|
17 |
Talwar, K., 'Single-sink buy-at-bulk LP has constant integrality gap,' Lecture Notes in Computer Science, Vol.2337(2002)
|
18 |
Guha, S., A. Meyerson, and K. Munagala, 'A constant factor approximation for the single sink edge installation problem,' Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, 2001
|
19 |
Krishnamanchari B. and S.B. Wicker, 'Optimization of fixed network design in cellular systems using local search algorithm,' Proceedings of IEEE VTC, (2000), pp. 1632-1638
|
20 |
Charikar, M., C. Chekuri, A. Goel, and S. Guha, 'Approximating a finite metric by a small number of tree metrics,' Proceedings of the 39th Symposium on Foundations of Computer Science, 1998
|
21 |
Awerbuch, B. and Y. Azar, 'Buy-at-bulk network design,' Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997
|
22 |
Epstein, R., Programming and capacitated network loading, Ph.D. Thesis, MIT, 1998
|