Optimization Problems in Mobile Communication

[1]  Gilbert Syswerda,et al.  The Application of Genetic Algorithms to Resource Scheduling , 1991, International Conference on Genetic Algorithms.

[2]  Susan H. Rodger,et al.  A new approach to the dynamic maintenance of maximal points in a plane , 1990, Discret. Comput. Geom..

[3]  Frits C. R. Spieksma,et al.  Interval selection: Applications, algorithms, and lower bounds , 2003, J. Algorithms.

[4]  Kalyanmoy Deb,et al.  Muiltiobjective Optimization Using Nondominated Sorting in Genetic Algorithms , 1994, Evolutionary Computation.

[5]  Kai-Yeung Siu,et al.  Dynamic assignment of orthogonal variable-spreading-factor codes in W-CDMA , 2000, IEEE Journal on Selected Areas in Communications.

[6]  A. Brandstädt,et al.  Graph Classes: A Survey , 1987 .

[7]  Peter J. Fleming,et al.  Genetic Algorithms for Multiobjective Optimization: FormulationDiscussion and Generalization , 1993, ICGA.

[8]  Thomas Erlebach,et al.  Joint Base Station Scheduling , 2004, WAOA.

[9]  Takao Nishizeki,et al.  Efficient Algorithms for Weighted Colorings of Series-Parallel Graphs , 2001, ISAAC.

[10]  Matteo Fischetti,et al.  Frequency assignment in mobile radio systems using branch-and-cut techniques , 2000, Eur. J. Oper. Res..

[11]  Edoardo Amaldi,et al.  Discrete models and algorithms for the capacitated location problems arising in UMTS network planning , 2001, DIALM '01.

[12]  Joseph Naor,et al.  New hardness results for congestion minimization and machine scheduling , 2004, STOC '04.

[13]  Marco Laumanns,et al.  SPEA2: Improving the Strength Pareto Evolutionary Algorithm For Multiobjective Optimization , 2002 .

[14]  Wen-Tsuen Chen,et al.  An Efficient Channelization Code Assignment Approach for W-CDMA , 2002 .

[15]  Heribert Vollmer,et al.  A polynomial-time approximation scheme for base station positioning in UMTS networks , 2001, DIALM '01.

[16]  Hasan Çam.  Non-blocking OVSF codes and enhancing network capacity for 3G wireless and beyond systems , 2003, Comput. Commun..

[17]  Kalyanmoy Deb,et al.  A Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimisation: NSGA-II , 2000, PPSN.

[18]  L. Khachiyan.  Polynomial algorithms in linear programming , 1980 .

[19]  F. Spieksma.  On the approximability of an interval scheduling problem , 1999 .

[20]  Antti Toskala,et al.  Wcdma for Umts , 2002 .

[21]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[22]  A. Gräf,et al.  On Coloring Unit Disk Graphs , 1998, Algorithmica.

[23]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .

[24]  J. M. Hernando,et al.  Introduction to Mobile Communications Engineering , 1999 .

[25]  Romano Fantacci,et al.  Multiple access protocol for integration of variable bit rate multimedia traffic in UMTS/IMT-2000 based on wideband CDMA , 2000, IEEE Journal on Selected Areas in Communications.

[26]  Gary B. Lamont,et al.  Multiobjective optimization with messy genetic algorithms , 2000, SAC '00.

[27]  Yoshikuni Onozato,et al.  Data rate improvement with dynamic reassignment of spreading codes for DS-CDMA , 2002, Comput. Commun..

[28]  Manuel Blum,et al.  Time Bounds for Selection , 1973, J. Comput. Syst. Sci..

[29]  Angelos N. Rouskas,et al.  OVSF codes assignment and reassignment at the forward link of W-CDMA 3G systems , 2002, The 13th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications.

[30]  Thomas Erlebach,et al.  An Algorithmic View on OVSF Code Assignment , 2004, STACS.

[31]  Peter J. Bentley,et al.  Methods to Evolve Legal Phenotypes , 1998, PPSN.

[32]  Thomas Erlebach,et al.  Joint Base Station Scheduling , 2004 .

[33]  Stefan Felsner,et al.  Trapezoid Graphs and Generalizations, Geometry and Algorithms , 1997, Discret. Appl. Math..

[34]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[35]  Jan van Leeuwen,et al.  Maintenance of Configurations in the Plane , 1981, J. Comput. Syst. Sci..

[36]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..

[37]  Charles Gide,et al.  Cours d'économie politique , 1911 .

[38]  Tomás̆ Novosad,et al.  Radio Network Planning and Optimisation for Umts , 2006 .

[39]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[40]  Jon Louis Bentley,et al.  Multidimensional divide-and-conquer , 1980, CACM.

[41]  David P. Dobkin,et al.  Space Searching for Intersecting Objects , 1987, J. Algorithms.

[42]  D. West.  Introduction to Graph Theory , 1995 .

[43]  Yoshikuni Onozato,et al.  Performance evaluation of orthogonal variable-spreading-factor code assignment schemes in W-CDMA , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[44]  S. Ranjithan,et al.  Using genetic algorithms to solve a multiple objective groundwater pollution containment problem , 1994 .

[45]  Sanjiv Kapoor.  Dynamic Maintenance of Maxima of 2-d Point Sets , 2000, SIAM J. Comput..

[46]  Harish Viswanathan,et al.  Dynamic load balancing through coordinated scheduling in packet data systems , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[47]  Martin Grötschel,et al.  The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..

[48]  Ulrich Killat,et al.  A new strategy for the application of genetic algorithms to the channel-assignment problem , 1999 .

[49]  Heribert Vollmer,et al.  The complexity of base station positioning in cellular networks , 2005, Discret. Appl. Math..

[50]  Jeffery L. Kennington,et al.  Hierarchical cellular network design with channel allocation , 2005, Eur. J. Oper. Res..

[51]  Bala Kalyanasundaram,et al.  Speed is as powerful as clairvoyance , 2000, JACM.

[52]  Michael T. Goodrich,et al.  Three-Dimensional Layers of Maxima , 2004, Algorithmica.

[53]  Kai-Yeung Siu,et al.  Supporting rate guarantee and fair access for bursty data traffic in W-CDMA , 2001, IEEE J. Sel. Areas Commun..

[54]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[55]  Louis Monier,et al.  Combinatorial Solutions of Multidimensional Divide-and-Conquer Recurrences , 1980, J. Algorithms.

[56]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[57]  Ravi Janardan,et al.  On the Dynamic Maintenance of Maximal Points in the Plane , 1991, Inf. Process. Lett..

[58]  Geraldo Robson Mateus,et al.  An optimization model for the BST location problem in outdoor cellular and PCS systems , 1997 .

[59]  Lothar Thiele,et al.  Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach , 1999, IEEE Trans. Evol. Comput..

[60]  Brigitte Jaumard,et al.  Mathematical Models and Exact Methods For Channel Assignment in Cellular Networks , 1999 .

[61]  Wen-Tsuen Chen,et al.  A novel code assignment scheme for W-CDMA systems , 2001, IEEE 54th Vehicular Technology Conference. VTC Fall 2001. Proceedings (Cat. No.01CH37211).

[62]  Peter Widmayer,et al.  Evolutionary multiobjective optimization for base station transmitter placement with frequency assignment , 2003, IEEE Trans. Evol. Comput..

[63]  Peter Ross,et al.  Improving Evolutionary Timetabling with Delta Evaluation and Directed Mutation , 1994, PPSN.

[64]  Mikkel T. Jensen,et al.  Reducing the run-time complexity of multiobjective EAs: The NSGA-II and other algorithms , 2003, IEEE Trans. Evol. Comput..

[65]  Fumiyuki Adachi,et al.  Tree-structured generation of orthogonal spreading codes with different lengths for forward link of DS-CDMA mobile radio , 1997 .

[66]  Bala Kalyanasundaram,et al.  Speed is as powerful as clairvoyance [scheduling problems] , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[67]  Peter van Emde Boas,et al.  Design and implementation of an efficient priority queue , 1976, Mathematical systems theory.

[68]  Kurt Mehlhorn,et al.  Dynamic fractional cascading , 1990, Algorithmica.