1 |
K. W. Richardson, 'UMTS overview,' IEEE Electron. Commun. Eng. J., vol. 12, no. 3, pp. 93-100, 2000
DOI
ScienceOn
|
2 |
M. R. Garey and D. S. Johson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Company, NY, 1979
|
3 |
I. Demirkol, C. Ersoy, M. Caglayan, and H. Delic, 'Location area planning in cellular networks using simulated annealing,' in Proc. INFOCOM 2001, 2001
|
4 |
P. Van Hentenryck, 'Search and strategies in OPL,' ACM Trans. Computational Logic, vol. 1, no. 2, pp. 282-315, Oct. 2000
|
5 |
ILOG CPLEX 7.1 User's Manual
|
6 |
ILOG Solver 5.1 User's Manual
|
7 |
E. Aarts and J. K. Lenstra, Local Search in Combinatorial Optimization, Wiley, 1997
|
8 |
E. Amaldi, A. Capone, and F. Malucelli, 'Planning UMTS base station location: Optimization models with power control and algorithms,' IEEE Trans. Wireless Commun., vol. 2, no. 5, pp. 939-952, Sept. 2003
DOI
ScienceOn
|
9 |
E. Amaldi, A. Capone, and F. Malucelli, 'Discrete models and algorithms for the capacitated location problem arising in UMTS network planning,' in Proc. ACM Dial-M, 2001, pp. 1-8
|
10 |
K. Marriott, Programming with Constraints: An Introduction, MIT Press, Cambridge, MA, 1998
|
11 |
R. Mathar and T. Niessen, 'Optimum positioning of base stations for cellular radio networks,' Wireless Networks, pp. 421-428, 2000
|
12 |
M. Wallace, Survey: Practical Applications of Constraint Programming, William Penney Laboratory, Imperial College, London, Sept. 1995
|
13 |
A. Merchant and B. Sengupta, 'Assignment of cells to switches in PCS networks,' IEEE/ACM Trans. Networking, vol. 3, no. 5, pp. 521-526, 1995
DOI
ScienceOn
|
14 |
H. Holma and A. Toskala, WCDMA for UMTS: Radio Access for Third Generation Mobile Communications, 2nd ed. John Wiley & Sons, Ltd., 2002
|
15 |
Y. Wu and S. Pierre, 'Optimization of access network design in 3G networks,' in Proc. IEEE CCECE 2003, 2003, pp. 781-784
DOI
|
16 |
S. Pierre and F. Houeto, 'A tabu search approach for assigning cells to switches in cellular mobile networks,' Computer Commun., 25, pp. 464-477, 2002
DOI
ScienceOn
|
17 |
D. Gross and C. M. Harris, Fundamentals of Queueing Theory, Wiley, New York, 1985
|
18 |
G. L. Nemhauser and L. A. Worlsy, Integer and Combinatorial Optimization, Wiley, 1988
|
19 |
I. J. Lustig and J. F. Puget, 'Program does not equal program: Constraint programming and its relationship to mathematical programming,' Interfaces, vol. 31, no. 6, pp. 29-53, 2001
|