Comparison of column generation models for channel assignment in cellular networks

Discrete Applied Mathematics

Volumn 112, Issue 1-3, 2001, Pages 217-240

  Jaumard, Brigitte ^a   Marcotte, Odile ^b   Meyer, Christophe ^c   Vovor, Tsevi ^d  

^a GERAD   (Canada)

^b UNIVERSITÉ DU QUÉBEC À MONTRÉAL   (Canada)

^c GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^d Prudential Securities Inc   (United States)

Author keywords

0 1 Integer linear program; Branch and bound; Cellular network; Channel assignment; Column generation; Resource constraints; Shortest path; Weighted independent set

Indexed keywords

EID: 0035885268     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(00)00317-6     Document Type: Article

References (44)

1. K.I. Aardal, A. Hipolito, C.P.M. van Hoesel, A branch-and-cut algorithm for the frequency assignment problem, manuscript, ftp://ftp.unimaas.nl/pub/grey_files/fdew/1996/rm96-011.ps, 1997.
2. P. Adjakplé, Affectation de canaux dans les réseaux de téléphonie mobile cellulaire, Ph.D. Thesis, École Polytechnique de Montréal, Canada, 1998.
3. Bertossi A.A., Bonuccelli M.A. Code assignment for hidden terminal interference avoidance in multihop packet radio networks. IEEE/ACM Trans. Networking. 3(4):1995;441-449.
4. Borndörfer R., Eisenblätter A., Grötschel M., Martin A. Frequency assignment in cellular phone networks. Ann. Oper. Res. 76:1998;73-93.
5. TM Callable Library (Version 6.0), CPLEX Optimization Inc., 1998.
6. Desrosiers J., Dumas Y., Solomon M.M., Soumis F. Ball M.O.et al. Constrained Routing and Scheduling, Handbooks in Operations Research and Management Science, Vol. 8. 1996;Elsevier Science B.V, Amsterdam.
7. Duque-Antón M., Kunz D., Rüber B. Channel assignment for cellular radio using simulated annealing. IEEE Trans. Veh. Technol. VT-42(1):1993;14-21.
8. O. du Merle, D. Villeneuve, J. Desrosiers, P. Hansen, Stabilized column generation, Les Cahiers du GERAD G-98-06, GERAD, February 1998 (revised June 1998).
9. M. Fischetti, C. Lepschy, G. Minerva, G.R. Jacur, E. Toto, Frequency assignment in mobile radio systems using branch-and-cut techniques, 1997, submitted for publication.
10. Gamst A. Homogeneous distribution of frequencies in a regular hexagonal cell system. IEEE Trans. Veh. Technol. VT-31(3):1982;132-144.
11. Gamst A. Some lower bounds for a class of frequency assignment problems. IEEE Trans. Veh. Technol. VT-35(1):1986;8-14.
12. M.R. Garey, D.S. Johnson, Computers and Intractability, A Guide to the Theory of NP-completeness, W.H. Freeman, San Francisco, CA, 1979.
13. A.I. Giortzis, L.F. Turner, A mathematical programming approach to the channel assignment problem in radio networks, Proceedings IEEE 46th Vehicular Technology Conference, Vol. 2, 1996, pp. 736-740.
14. Hale W.K. Frequency assignment: theory and applications. Proc. IEEE. 68(12):1980;1497-1514.
15. P. Hansen, B. Jaumard, C. Meyer, An efficient algorithm for unconstrained 0-1 quadratic programming, Manuscript, 1999.
16. P. Hansen, B. Jaumard, N. Mladenovic, A. Parreira, Variable neighborhood search for weighted maximum satisfiability, manuscript, 1999.
17. C.A.J. Hurkens, S.R. Tiourine, Upper and lower bounding techniques for frequency assignment problems, 1995, ftp://ftp.win.tue.nl/pub/techreports/cosor/95-34.ps.
18. S. Hurley, S.U. Thiel, D.H. Smith, A comparison of local search algorithms for radio link frequency assignment problems, ACM Symposium on Applied Computing, Philadelphia, 1996, pp. 251-257.
19. J. Janssen, K. Kilakos, Polyhedral analysis of channel assignment problems: (I) tours, Technical Report CDAM-96-17, London School of Economics and Political Science, August 1996.
20. J. Janssen, K. Kilakos, Polyhedral analysis of channel assignment problems: (II) tilings, Technical Report CDAM-96-17, London School of Economics and Political Science, August 1996.
21. B. Jaumard, D. Boyer, T. Vovor, PULSAR - a method for optimizing channel assignment in bell mobilité cellular systems with arbitrary channel blocks, manuscript, 1998.
22. B. Jaumard, O. Marcotte, C. Meyer, Estimation of the quality of cellular networks using column generation techniques, Technical Report G-98-02, GERAD, January 1998.
23. Jaumard B., Marcotte O., Meyer C. Mathematical models and exact methods for channel assignment in cellular networks. Sansò B., Soriano P. Telecommunications Network Planning. 1998;239-256 Kluwer, Dordrecht.
24. B. Jaumard, C. Meyer, T. Vovor, A compact formulation of the antenna channel spacing constraints, manuscript, 1999.
25. Jaumard B., Meyer C., Vovor T. How to combine a column and row generation method or row elimination procedure - application to the channel assignment problem. Badrinath R., Hsu F., Pardalos P.M., Rajasekaran S. Mobile Networks and Computing. DIMACS Series. 1999;American Mathematical Society, Providence, RI.
26. B. Jaumard, T. Vovor, A column generation approach for the exact solution of channel assignment problems, Technical Report G-98-39, GERAD, Montréal, Canada, July 1998.
27. B. Jaumard, T. Vovor, F. Semet, A two-phase resource constrained shortest path algorithm, Networks, to appear.
28. Koster A.M.C.A., van Hoesel S.P.M., Kolen A.W.J. The partial constraint satisfaction problem: facets and lifting theorems. Oper. Res. Lett. 23(3):1998;89-98.
29. S. Krau, Extensions du problème de Weber, Ph.D. Thesis, École Polytechnique de Montréal, Montréal (Québec) Canada, février, 1997.
30. Lee W.C.Y. Mobile Cellular Telecommunications: Analog and Digital Systems. 2nd Edition:1995;McGraw-Hill, New York.
31. A. Mehrotra, M.A. Trick, A column generation approach for graph coloring, INFORMS J. Comput. 8(4) (1996) 344-354, http://mat.gsia.cmu.edu/color.ps.
32. Mouly M., Pautet M.-B. The GSM System for Mobile Communications. 1992;Cell & Sys, France.
33. Nemhauser G.L., Sigismondi G. A strong cutting plane/branch-and-bound algorithm for node packing. J. Oper. Res. Soc. 43(5):1992;443-457.
34. Nemhauser G.L., Trotter L.E. Properties of vertex packing and independence system polyhedra. Math. Programming. 6:1974;48-61.
35. Nemhauser G.L., Trotter L.E. Vertex packings: structural properties and algorithms. Math. Programming. 8:1975;232-248.
36. Nemhauser G.L., Wolsey L.A. Integer and Combinatorial Optimization. 1988;Wiley, New York.
37. Padberg M.W. On the facial structure of set packing polyhedra. Math. Programming. 5:1973;199-215.
38. Pardalos P.M., Rodgers G.P. Computational aspects of a branch-and-bound algorithm for quadratic zero-one programming. Computing. 45(2):1990;131-144.
39. Rappaport T.S. Wireless Communications - Principles & Practice. 1996;Prentice-Hall, Englewood Cliffs, NJ.
40. Smith D.H., Hurley S. Bounds for the frequency assignment problem. Discrete Math. 167/168:1997;571-582.
41. Tcha D.-W., Chung Y.-J., Choi T.-J. A new lower bound for the frequency assignment problem. IEEE/ACM Trans. Networking. 5(1):1997;34-39.
42. S. Thienel, ABACUS 2.0. User's Guide and Reference Manual, Technical Report, Universität zu Köln, 1997. http://www.informatik.uni-koeln.de/ls_juenger/ projects/abacus/manual.ps.gz.
43. S. Tiourine, C. Hurkens, J.L. Lenstra, An overview of algorithmic approaches to frequency assignment problems, 1995, ftp://ftp.win.tue.nl/pub/techreports/CALMA/overview.ps.
44. Warners J.P., Terlaky T., Roos C., Jansen B. A potential reduction approach to the frequency assignment problem. Discrete Appl. Math. 78:1997;251-282.