Source: http://fap.zib.de
Keyword: Frequency Assignment Problems (FAPs)
2002
Allen et al., 2002
Allen, S. M., Smith, D. H., and Hurley, S. (2002).
Generation of lower bounds for minimum span frequency assignment.
Discrete Applied Mathematics, 119(1-2):59-78.
Avenali et al., 2002
Avenali, A., Mannino, C., and Sassano, A. (2002).
Minimizing the span of -walks to compute optimum frequency assignments.
Mathematical Programming, 91(2):357-374.
previously published as techincal report 04-00, DIS-Università di Roma ``La Sapienza'',
Rome, Italy.
Gerke and McDiarmid, 2002
Gerke, S. and McDiarmid, C. (2002).
Channel assignment with large demands.
Annals of Operations Research, 107(1-4):143-159.
Hurley et al., 2002
Hurley, S., Whitaker, R. M., and Smith, D. H. (2002).
Channel loading in private mobile radio networks.
Annals of Operations Research, 107(1-4):211-224.
Jaumard et al., 2002
Jaumard, B., Marcotte, O., Meyer, C., and Vovor, T. (2002).
Comparison of column generation models for channel assignment in cellular networks.
Discrete Applied Mathematics, 118:299-322.
previously published as technical report of Ecole Polytechnique de Montréal, November
1998.
Heuvel and Pejicacute, 2002
Heuvel, J. v. d. and Pejicacute, S. (2002).
Using Laplacian eigenvalues and eigenvectors in the analysis of frequency assignment
problems.
Annals of Operations Research, 107(1-4):349-368.
Smith et al., 2002
Smith, D. H., Allen, S. M., and Hurley, S. (2002).
Characteristics of good meta-heuristic algorihtms for the frequency assignment problem.
Annals of Operations Research, 107(1-4):285-301.
Struzak, 2002
Struzak, R. (2002).
On spectrum congestion and capacity of radio links.
Annals of Operations Research, 107(1-4):339-347.
Mathar and Schmeink, 2002
Mathar, R. and Schmeink, M. (2002).
Optimal base station positioning and channel assignment for 3G mobile networks by
integer programming.
Annals of Operations Research, 107(1-4):225-236
Reininger and Caminada, 2002
Reininger, P. and Caminada, A. (2002).
Multicriteria design model for cellular network.
Annals of Operations Research, 107(1-4):251-265.
Montemanni et al., 2002a
Montemanni, R., Moon, J. N. J., and Smith, D. H. (2002a).
An improved tabu search algorithm for the fixed spectrum frequency assignment
problem.
Technical report, University of Glamorgan.
in preperation.
Montemanni et al., 2002b
Montemanni, R., Smith, D. H., and Allen, S. M. (2002b).
Lower bounds for fixed spectrum frequency assignment.
Annals of Operations Research, 107(1-4):237-250.
.
2001
Aardal et al., 2001
Aardal, K. I., Hoesel, C. P. M. v., Koster, A. M. C. A., Mannino, C., and Sassano, A.
(2001).
Models and solution techniques for the frequency assignment problem.
ZIB-report 01-40, Konrad-Zuse-Zentrum für Informationstechnik Berlin, Berlin,
Germany.
Available at http://www.zib.de/PaperWeb/abstracts/ZR-01-40/ or
http://fap.zib.de/survey/.
Correia, 2001
Correia, L. M., editor (2001).
Wireless Flexible Personalized Communications - COST 259: European Co-operation in
Mobile Radio Research.
John Wiley & Sons Ltd.
COST Action 259--Final Report
Janssen and Narayanan, 2001
Janssen, J. and Narayanan, L. (2001).
Approximation algorithms for the channel assignment problem.
Theoretical Computer Science A, 262:649-667.
Extended abstract published in the proceedings of ISAAC'99
Eisenblätter, 2001
Eisenblätter, A. (2001).
Frequency Assignment in GSM Networks: Models, Heuristics, and Lower Bounds.
PhD thesis, Technische Universität Berlin, Berlin, Germany.
Available at http://www.zib.de/bib/diss/
Koster et al., 2001
Koster, A. M. C. A., Hoesel, C. P. M. v., and Kolen, A. W. J. (2001).
Lower bounds for minimum interference frequency assignment problems.
Ricerca Operativa, 30(94-95):101-116.
previously published as Research Memorandum 99/026, Universteit Maastricht; available
at http://www.zib.de/koster/.
Matsui and Tokoro, 2001
Matsui, S. and Tokoro, K. (2001).
Improving the performance of a genetic algorithm for minimum span frequency
assignment problem with an adaptive mutation rate and a new initialization method.
In Proc. of GECCO-2001 (Genetic and Evolutionary Computation Conference), pages
1359-1366. Morgan Kaufmann Publishers.
Montemanni, 2001
Montemanni, R. (2001).
Upper and lower bounds for the fixed spectrum frequency assignment problem.
PhD thesis, Division of Mathematics and Statistics, School of Technology, University of
Glamorgan.
Smith et al., 2001
Smith, D. H., Taplin, R. K., and Hurley, S. (2001).
Frequency assignment with complex co-site constraints.
IEEE Transaction on Electromagnetic Compatibility, 43(2):210-218.
2000
Zhou et al., 2000
Zhou, X., Kanari, Y., and Nishizeki, T. (2000).
Generalized vertex-colorings of partial k-trees.
IEICE Transactions, E83-A(4):671-678.
publication of the Institute of Electronics, Information and Communication Engineers,
available at http://search.ieice.org/.
Björklund et al., 2000
Björklund, P., Värbrand, P., and Yuan, D. (2000).
Optimal gsm network planning with frequency hopping.
Presented at the 5th INFORMS Telecommunication Conference, Boca Raton, USA.
de Urries et al., 2000
de Urries, L. J., Guerra, M. A. D., and Berberana, I. (2000).
Frequency planning using simulated annealing.
Technical report, COST259.
Eisenblätter et al., 2000
Eisenblätter, A., Grötschel, M., and Koster, A. M. C. A. (2000).
Frequency assignment and ramifications of coloring.
ZIB-report 00-47, Konrad-Zuse-Zentrum für Informationstechnik Berlin, Berlin,
Germany.
Available at http://www.zib.de/PaperWeb/abstracts/ZR-00-47/. To be published
Eisenblätter and Kürner, 2000
Eisenblätter, A. and Kürner, T. (2000).
Benchmarking frequency allocation strategies.
Technical Report COST 259, TD (00) 44, COST 259.
Fischetti et al., 2000
Fischetti, M., Lepschy, C., Minerva, G., Romanin-Jacur, G., and Toto, E. (2000).
Frequency assignment in mobile radio systems using branch-and-cut techniques.
European Journal of Operational Research, 123:241-255.
previously published as technical report of the Universita di Padova.
Fitzpatrick et al., 2000
Fitzpatrick, S., Janssen, J., and Nowakowski, R. (2000).
Distributive channel assignment algorithms for cellular networks with constraints.
Technical Report G-2000-14, GERAD, HEC, Montreal, Canada.
Extended abstract in Proceedings of ARACNE 2000, preprint available at
http://www.mscs.dal.ca/~janssen/cv/publications.html.
Grötschel, 2000
Grötschel, M. (2000).
Frequency assignment in mobile phone systems.
In Kapoor and Prasad, editors, Lecture Notes in Computer Science, volume 1974, pages
81-86. FST TCS 2000: Foundations of Software Technology and Theoretical Computer
Science.
Available as ZIB-report at http://www.zib.de/PaperWeb/abstracts/ZR-00-58/
Hellebrandt and Heller, 2000
Hellebrandt, M. and Heller, H. (2000).
A new heuristic method for frequency assignment.
Technical Report TD(00)003, COST259, Valencia, Spain.
Heller, 2000
Heller, H. (2000).
private communication.
Janssen and Wentzell, 2000
Janssen, J. and Wentzell, T. (2000).
Lower bounds from tile covers for the channel assignment problem.
Technical Report G-2000-09, GERAD, HEC, Montreal, Canada.
preprint available at http://www.mscs.dal.ca/~janssen/cv/publications.html
Kim and Chang, 2000
Kim, S. and Chang, K.-N. (2000).
A gos updating algorithm for the minimum span problem in a cellular mobile system.
submitted to IEEE transaction on networking.
Maniezzo and Carbonaro, 2000
Maniezzo, V. and Carbonaro, A. (2000).
An ants heuristic for the frequency assignment problem.
Future Generation Computer Systems, 16:927 - 935.
Maniezzo and Montemanni, 2000
Maniezzo, V. and Montemanni, R. (2000).
An exact algorithm for the min-interference frequency assignment problem.
Technical Report WP-CO0003, Scienze dell'Informazione, University of Bologna,
Cesena, Italy.
Mannino et al., 2000
Mannino, C., Oriolo, G., and Sassano, A. (2000).
Weighted stable set problem in -thin graphs.
Technical Report 09-00, Universitá di Roma ``La Sapienza''
Mathar and Schmeink, 2000
Mathar, R. and Schmeink, M. (2000).
Integrated optimal cell site selection and frequency allocation for cellular radio networks.
Technical report, Aachen University of Technology.
Matsui and Tokoro, 2000
Matsui, S. and Tokoro, K. (2000).
A new genetic algorithm for minimum span frequency assignment using permutation and
clique.
In Proc. of GECCO-2000 (Genetic and Evolutionary Computation Conference), pages
682-689. Morgan Kaufmann Publishers
Nielsen and Wigard, 2000
Nielsen, T. T. and Wigard, J. (2000).
Performance Enhancements in a Frequency Hopping GSM Network.
Kluwers Academic Publishers.
ISBN: 0 7923 7819 9.
Smith et al., 2000a
Smith, D. H., Allen, S. M., and Hurley, S. (2000a).
Lower bounds for channel assignment.
In Leese, R., editor, Methods and Algorithms for Radio Channel Assignment. Oxford
University Press.
to appear.
Smith et al., 2000b
Smith, D. H., Hurley, S., and Allen, S. M. (2000b).
A new lower bound for the channel assignment problem.
IEEE Transactions on Vehicular Technology, 49(4):1265-1272.
Tiourine et al., 2000
Tiourine, S. R., Hurkens, C. A. J., and Lenstra, J. K. (2000).
Local search algorithms for the radio link frequency assignment problem.
Telecommunication systems, 13:293-314.
1999
Hao and Perrier, 1999
Hao, J.-K. and Perrier, L. (1999).
Tabu search for the frequency assignment problem in cellular radio networks.
European Journal of Operational Research, page (submittedAardal et al., 1999
Aardal, K. I., Hurkens, C. A. J., Lenstra, J. K., and Tiourine, S. R. (1999).
Algorithms for frequency assignment problems.
Technical report, Technische Universiteit Eindhoven
Allen et al., 1999a
Allen, S. M., Hurley, S., Smith, D. H., and Thiel, S. U. (1999a).
Using lower bounds in minimum span frequency assignment.
In et al., S. V., editor, Meta-Heuristics: Advances and Trends in Local Search Paradigms
for Optimization, pages 191-204. Kluwer.
Allen et al., 1999b
Allen, S. M., Smith, D. H., and Hurley, S. (1999b).
Lower bounding techniques for frequency assignment.
Discrete Mathematics, 197/198:41-52.
Beckmann and Killat, 1999a
Beckmann, D. and Killat, U. (1999a).
Frequency planning with respect to interference minimization in cellular radio networks.
Technical Report TD(99)032, COST259, Vienna, Austria
Beckmann and Killat, 1999b
Beckmann, D. and Killat, U. (1999b).
A new strategy for the application of genetic algorithms to the channel-assignment
problem.
IEEE Transactions on Vehicular Technology, 48(4):1261-1269
Beckmann and Killat, 1999c
Beckmann, D. and Killat, U. (1999c).
A powerful hybrid algorithm for the channel-assignment problem basing on evolutionary
optimization.
In Proc. "3rd European Personal Mobile Communicactions Conference", EPMCC'99,
Paris, France.
Cabon et al., 1999
Cabon, B., Givry, S. D., Lobjois, L., Schiex, T., and Warners, J. P. (1999).
Benchmarks problems: Radio link frequency assignment.
Constraints, 4:79-89.
Castelino and Stephens, 1999
Castelino, D. J. and Stephens, N. M. (1999).
A surrogate constraint tabu thresholding implementation for the frequency assignment
problem.
Annals of Operations Research, 86:259-270.
Eisenblätter et al., 1999
Eisenblätter, A., Kürner, T., and Fauß, R. (1999).
Analysis of c/i-ratio thresholds for frequency planning.
Technical Report COST 259, TD(99) 012, COST 259
Fotakis et al., 1999
Fotakis, D. A., Pantziou, G. E., Pentaris, G. P., and Spirakis, P. G. (1999).
Frequency Assignment in Mobile and Radio Networks, volume 45 of DIMACS Series in
Discrete Mathematics and Theoretical Computer Science, pages 73-90.
AMS.
Hao and Perrier, 1999
Hao, J.-K. and Perrier, L. (1999).
Tabu search for the frequency assignment problem in cellular radio networks.
European Journal of Operational Research, page (submitted
).
Technical report LGI2P, EMA-EERIE, Parc Scientifique Georges Besse, Nimes, France.
Janssen and Kilakos, 1999a
Janssen, J. and Kilakos, K. (1999a).
Bounded stable sets: Polytopes and colourings.
SIAM Journal on Discrete Mathematics, 12(2):262-275.
previously published as report CDAM-96-18, London School of Economics.
Janssen and Kilakos, 1999b
Janssen, J. and Kilakos, K. (1999b).
An optimal solution to the ``Philadelphia'' channel assignment problem.
IEEE Transactions on Vehicular Technology, 48(3):1012-1014.
previously published as report CDAM-96-16, London School of Economics.
Janssen et al., 1999
Janssen, J., Kilakos, K., and Marcotte, O. (1999).
Fixed preference channel assignment for cellular telephone systems.
IEEE Transactions on Vehicular Technology, 48:533-541.
Jaumard et al., 1999
Jaumard, B., Marcotte, O., and Meyer, C. (1999).
Mathematical models and exact methods for channel assignment in cellular networks.
In Sansáo, B. and Soriano, P., editors, Telecommunications Network Planning,
chapter 13, pages 239-255. Kluwer Academic Publishers, Boston.
Kolen, 1999
Kolen, A. W. J. (1999).
A genetic algorithm for frequency assignment.
Technical report, Maastricht University.
Koster et al., 1999a
Koster, A. M. C. A., Hoesel, C. P. M. v., and Kolen, A. W. J. (1999a).
Optimal solutions for a frequency assignment problem via tree-decomposition.
Lecture Notes in Computer Science, 1665:338-349.
Koster et al., 1999b
Koster, A. M. C. A., Hoesel, C. P. M. v., and Kolen, A. W. J. (1999b).
Solving frequency assignment problems via tree-decomposition.
Technical Report RM 99/011, Maastricht University.
Available at http://www.zib.de/koster/.
Koster et al., 1999c
Koster, A. M. C. A., Hoesel, C. P. M. v., and Kolen, A. W. J. (1999c).
Solving frequency assignment problems via tree-decomposition.
Electronic Notes on Discrete Mathematics, 3.
Available at http://www.elsevier.nl/locate/endm/.
Murphey et al., 1999
Murphey, R. A., Pardalos, P. M., and Resende, M. G. C. (1999).
Frequency assignment problems.
In Du, D.-Z. and Pardalos, P. M., editors, Handbook of combinatorial optimization,
volume Supplement Volume A. Kluwer Academic Publishers
Nielsen et al., 1999
Nielsen, T. T., Wigard, J., Michaelsen, P. H., and Mogensen, P. (1999).
Resource allocation in a frequency hopping pcs1900/gsm/dcs1800 type of network.
IEEE Transactions on Vehicular Technology, pages 209-214.
Sandalidis et al., 1999
Sandalidis, H. G., Stavroulakis, P. P., and Rodriguez-Tellez, J. (1999).
Borrowing channel assignment strategies based on heuristic techniques for cellular
systems.
IEEE Transactions on Neural Networks, 10:176-181.
Aardal et al., 1999
Aardal, K. I., Hurkens, C. A. J., Lenstra, J. K., and Tiourine, S. R. (1999).
Algorithms for frequency assignment problems.
Technical report, Technische Universiteit Eindhoven.
Allen et al., 1999b
Allen, S. M., Smith, D. H., and Hurley, S. (1999b).
Lower bounding techniques for frequency assignment.
Discrete Mathematics, 197/198:41-52.
Allen et al., 1999a
Allen, S. M., Hurley, S., Smith, D. H., and Thiel, S. U. (1999a).
Using lower bounds in minimum span frequency assignment.
In et al., S. V., editor, Meta-Heuristics: Advances and Trends in Local Search Paradigms
for Optimization, pages 191-204. Kluwer.
Beckmann and Killat, 1999a
Beckmann, D. and Killat, U. (1999a).
Frequency planning with respect to interference minimization in cellular radio networks.
Technical Report TD(99)032, COST259, Vienna, Austria.
Beckmann and Killat, 1999b
Beckmann, D. and Killat, U. (1999b).
A new strategy for the application of genetic algorithms to the channel-assignment
problem.
IEEE Transactions on Vehicular Technology, 48(4):1261-1269.
Beckmann and Killat, 1999c
Beckmann, D. and Killat, U. (1999c).
A powerful hybrid algorithm for the channel-assignment problem basing on evolutionary
optimization.
In Proc. "3rd European Personal Mobile Communicactions Conference", EPMCC'99,
Paris, France.
Cabon et al., 1999
Cabon, B., Givry, S. D., Lobjois, L., Schiex, T., and Warners, J. P. (1999).
Benchmarks problems: Radio link frequency assignment.
Constraints, 4:79-89.
Castelino and Stephens, 1999
Castelino, D. J. and Stephens, N. M. (1999).
A surrogate constraint tabu thresholding implementation for the frequency assignment
problem.
Annals of Operations Research, 86:259-270.
Eisenblätter et al., 1999
Eisenblätter, A., Kürner, T., and Fauß, R. (1999).
Analysis of c/i-ratio thresholds for frequency planning.
Technical Report COST 259, TD(99) 012, COST 259.
Fotakis et al., 1999
Fotakis, D. A., Pantziou, G. E., Pentaris, G. P., and Spirakis, P. G. (1999).
Frequency Assignment in Mobile and Radio Networks, volume 45 of DIMACS Series in
Discrete Mathematics and Theoretical Computer Science, pages 73-90.
AMS.
Koster, 1999
Koster, A. M. C. A. (1999).
Frequency Assignment - Models and Algorithms.
PhD thesis, Maastricht University.
Available at http://www.zib.de/koster/thesis.html.
1998
Shepherd, 1998
Shepherd, M. A. (1998).
Radio Channel Assignment.
PhD thesis, Oxford Univerisity
Smith et al., 1998a
Smith, D. H., Allen, S. M., Hurley, S., and Watkins, W. J. (1998a).
Frequency Assignment: Methods and Algorithms.
In RTO IST Symposium on Frequency Assignment, Sharing and Conservation in Systems
(Aerospace), Aalborg, Denmark, 5-7 October 1998, pages K-1-K-18.
Smith et al., 1998b
Smith, D. H., Hurley, S., and Thiel, S. U. (1998b).
Improving heuristics for the frequency assignment problem.
European Journal of Operational Research, 107:76-86.
Smith, 1998
Smith, K. A. (1998).
A genetic algorithm for the channel assignment problem.
IEEE Global Communications Conference, 4:2013-2017.
Smith et al., 1998c
Smith, K. A., Kim, B. K., and Sargent, G. F. (1998c).
Minimising channel interference in real cellular radio networks.
IEEE Global Communications Conference, 4:2192-2197.
Tsang and Voudouris, 1998
Tsang, E. and Voudouris, C. (1998).
Solving the radio link frequency assignment problem using guided local search.
In NATO Symposium on Radio Length Frequency Assignment, Aalborg, Denmark.
Available at http://cswww.essex.ac.uk/CSP/papers.html.
van den Heuvel et al., 1998
van den Heuvel, J., Leese, R. A., and Shepherd, M. A. (1998).
Graph labelling and radio channel assignment.
Journal of Graph Theory, 29:263-284.
van den Heuvel, J. (1998).
Radio channel assignment on 2-dimensional lattices.
Technical Report LSE-CDAM-98-05, London School of Economics, CDAM.
Available at http://www.cdam.lse.ac.uk/Reports/Abstracts/cdam-98-05.html.
Valenzuela et al., 1998
Valenzuela, C., Hurley, S., and Smith, D. H. (1998).
A permutation based genetic algorithm for minimum span frequency assignment.
Lecture Notes in Computer Science, 1498:907-916.
Al-Khaled, 1998
Al-Khaled, F. S. (1998).
Optimal radio channel assignment through the new binary dynamic simulated annealing
algorithm.
International Journal of Communication Systems, 11:327-336.
Bater et al., 1998
Bater, J., Jeavons, P., and Cohen, D. (1998).
Are there optimal reuse distance constraints for FAPs with random Tx placements?
Technical Report CSD-TR-98-01, Royal Holloway University of London.
Beckmann and Killat, 1998
Beckmann, D. and Killat, U. (1998).
Optimierung von mobilfunknetzen nach dem vorbild der biologischen evolution.
TUHH-Spektrum.
Borndörfer et al., 1998a
Borndörfer, R., Eisenblätter, A., Grötschel, M., and Martin, A. (1998a).
Frequency assignment in cellular phone networks.
Annals of Operations Research, 76:73-93.
Borndörfer et al., 1998b
Borndörfer, R., Eisenblätter, A., Grötschel, M., and Martin, A. (1998b).
The orientation model for frequency assignment problems.
Technical Report TR 98-01, Konrad-Zuse-Zentrum für Informationstechnik Berlin.
Crisan and Mühlenbein, 1998a
Crisan, C. and Mühlenbein, H. (1998a).
The breeder genetic algorithm for frequency assignment.
Lecture Notes in Computer Science, 1498:897-906.
Crisan and Mühlenbein, 1998b
Crisan, C. and Mühlenbein, H. (1998b).
The frequency assginment problem: A look at the performance of evolutionary search.
Lecture Notes in Computer Science, 1363:263-274.
Dorne and Hao, 1998
Dorne, R. and Hao, J.-K. (1998).
A new genetic local search algorithm for graph coloring.
Lecture Notes in Computer Science, 1498:745-754.
Dunkin et al., 1998
Dunkin, N., Bater, J., Jeavons, P., and Cohen, D. (1998).
Towards high order constraint representations for the frequency assignment problem.
Technical Report CSD-TR-98-05, Royal Holloway University of London.
Available at http://www.dcs.rhbnc.ac.uk/research/constraints/publications/index.shtml.
Eisenblätter, 1998
Eisenblätter, A. (1998).
Proposal: File formats for standard scenarios for frequency planning.
Technical Report COST 259, TD(98) 48, COST 259.
.
in Discussiones Mathematicae Graph Theory.
Eisenblätter et al., 1998
Eisenblätter, A., Kürner, T., and Fauß, R. (1998).
Radio planning algorithms for interference reduction in cellular networks.
In 252/259, C., editor, Communications for the Millennium. COST 252/259 Joint
Workshop, University of Bradford, 21-22 apr 1998., pages 87-92.
Available by ftp.
Feder and Shende, 1998
Feder, T. and Shende, S. M. (1998).
Online channel allocation in FDMA networks with reuse constraints.
Technical Report 98-17, DIMACS
Fotakis and Spirakis, 1998
Fotakis, D. A. and Spirakis, P. G. (1998).
Graph labelling and assignment of non-reusable frequencies.
Lecture Notes in Computer Science, 1530:18-29.
Hao et al., 1998
Hao, J.-K., Dorne, R., and Galinier, P. (1998).
Tabu search for frequency assignment in moblie radio networks.
Journal of Heuristics, 4:47-62.
Janssen and Kilakos, 1998
Janssen, J. and Kilakos, K. (1998).
Tile covers, closed tours and the radio spectrum.
In Sansó, B. and Soriano, P., editors, Telecommunications Network Planning, chapter 14.
Kluwer Academic Publishers.
previously published as report CDAM-97-08, London School of Economics.
Janssen et al., 1998
Janssen, J., Krizanc, D., Narayanan, L., and Shende, S. (1998).
Distributed online frequency assignment in cellular networks.
Lecture Notes in Computer Science, 1373:3-13.
Jaumard et al., 1998
Jaumard, B., Marcotte, O., and Meyer, C. (1998).
Estimation of the quality of cellular networks using column generation techniques.
Technical Report G-98-02, Ecole Polytechnique de Montréal.
Jaumard and Vovor, 1998
Jaumard, B. and Vovor, T. (1998).
A column generation approach for the exact solution of channel assignment problems.
Technical Report G-98-39, Ecole Polytechnique de Montréal.
Jeavons et al., 1998
Jeavons, P., Dunkin, N., and Bater, J. (1998).
Why higher order constraints are necessary to model frequency assignment problems.
In Proceedings of ECAI 98. John Wiley & Sons, Ltd.
Khanna and Kumaran, 1998
Khanna, S. and Kumaran, K. (1998).
On wireless spectrum estimation and generalized graph coloring.
In INFOCOM '98.
Kind et al., 1998
Kind, J., Niessen, T., and Mathar, R. (1998).
Theory of maximum packing and related channel assignment strategies for cellular radio
networks.
Mathematical methods of operations research, 48:1-16.
Koster et al., 1998
Koster, A. M. C. A., Hoesel, C. P. M. v., and Kolen, A. W. J. (1998).
The partial constraint satisfaction problem: Facets and lifting theorems.
Operations Research Letters, 23(3-5):89-97.
Leese, 1998
Leese, R. A. (1998).
A linear programming approach to radio channel assignment in heavily loaded, evolving
networks.
Presentation at NATO Symposium, Aalborg, Denmark.
Mannino and Sassano, 1998
Mannino, C. and Sassano, A. (1998).
An enumerative algorithm for the frequency assignment problem.
Technical Report 1096, Università di Roma La Sapienza.
McDiarmid, 1998
McDiarmid, C. (1998).
A doubly cyclic channel assignment problem.
Discrete Applied Mathematics, 80:263-268.
Molloy and Reed, 1998
Molloy, M. and Reed, B. (1998).
Further algorithmic aspects of the lovasz local lemma.
In Proc. 30th Annual ACM Symposium on the Theory of Computing, pages 524-529.
Ngo and Li, 1998
Ngo, C. Y. and Li, V. O. K. (1998).
Fixed channel assignment in cellular radio networks using a modified genetic algorithm.
IEEE Transactions on Vehicular Technology, 47:163-171.
Pasechnik, 1998
Pasechnik, D. V. (1998).
An interior point approximation algorithm for a class of combinatorial optimization
problems: Implementation and enhancements.
Technical report, Delft University of Technology.
1997
Rushforth and Wang, 1997
Rushforth, C. and Wang, W. (1997).
Local search for channel assignment in cellular mobile networks.
In DIMACS Series in Discrete Mathematics and Theoretical Computer Science,
volume 35, pages 689-709. American Mathematical Society.
Schneider, 1997
Schneider, K. (1997).
Frequenzzuweisung im Mobilfunk mittels lokaler Suche.
Adjakplé and Jaumard, 1997
Adjakplé, P. M. and Jaumard, B. (1997).
Greedy and tabu search heuristics for channel block assignment in cellular systems.
Technical Report G-97-45, École Polytechnique de Montréal.
Battiti et al., 1997
Battiti, R., Bertossi, A., and Brunato, M. (1997).
Cellular channel assignment: comparing and simplifying heuristics.
In Proceedings of the IEEE/AMC Workshop Dial M for Mobility, Budapest.
Chang and Kim, 1997
Chang, K.-N. and Kim, S. (1997).
Channel allocation in cellular radio networks.
Computers and Operations Research, 24:849-860.
Dunkin and Allen, 1997
Dunkin, N. and Allen, S. M. (1997).
Frequency assignment problems: Representations and solutions.
Technical Report CSD-TR-97-14, Royal Holloway, University of London.
Available at http://www.dcs.rhbnc.ac.uk/research/constraints/publications/index.shtml.
Dunkin and Jeavons, 1997
Dunkin, N. and Jeavons, P. (1997).
Expressiveness of binary constraints for the frequency assignment problem.
In DIAL-M Workshop, 3rd Annual ACM/IEEE International Conference on Mobile
Computing and Networking (MOBICOM'97).
Eisenblätter, 1997
Eisenblätter, A. (1997).
A frequency assignment problem in cellular phone networks. (extended abstract).
In Pardalos, P. M. and Du, D., editors, Network design: connectivity and facilities
location. DIMACS workshop, apr 28-30, 1997., volume 40 of DIMACS, pages 109-115.
AMS.
Funabiki and Nishikawa, 1997
Funabiki, N. and Nishikawa, S. (1997).
A gradual neural-network approach for frequency assignment in satellite communication
systems.
IEEE Transactions on Neural Networks, 8:1359-1370.
Giortzis and Turner, 1997
Giortzis, A. I. and Turner, L. F. (1997).
Application of mathematical programming to the fixed channel assignment problem in
mobile radio networks.
IEE Proceedings - Communications, 144:257-264.
Givry et al., 1997
Givry, S. D., Verfaillie, G., and Schiex, T. (1997).
Bounding the optimum of constraint optimization problems.
In Proceedings of the 3rd International Conference on Principles and Practice of
Constraint Programming (CP-97).
Gotzner et al., 1997
Gotzner, U., Gamst, A., and Rathgeber, R. (1997).
Statial traffic distribution in cellular networks.
In Proc. IEEE VTC'97 Ottawa Canada, pages 1994-1998.
Hurley et al., 1997
Hurley, S., Smith, D. H., and Thiel, S. U. (1997).
FASoft: A system for discrete channel frequency assignment.
Radio Science, 32:1921-1939.
Lecture Notes in Computer Science, 657:50-59.
Janssen and Kilakos, 1997
Janssen, J. and Kilakos, K. (1997).
A polyhedral analysis of channel assignment problems based on tours (extended
abstract).
In Proceedings of the 1997 IEEE International Conference on Communications.
previously published as report CDAM-96-17, London School of Economics.
Kaminsky, 1997
Kaminsky, A. R. (1997).
A fuzzy genetic algorithm for automatic channel assignment for tactical HF radio
networks.
IEE Conference Publication, 411:236-241.
Lorentzen, 1997
Lorentzen, R. (1997).
The frequency assignment algorithms used in mobinett.
Technical Report R&D R 51/97, Telenor FoU, Kjeller, Norway.
Malesinska, 1997
Malesinska, E. (1997).
Graph-Theoretical Models for Frequency Assignment Problems.
PhD thesis, Technische Universität Berlin.
Niessen, 1997
Niessen, T. (1997).
Optimal channel allocation for several types of cellular radio networks.
Discrete Applied Mathematics, 79:155-170.
Smith and Hurley, 1997
Smith, D. H. and Hurley, S. (1997).
Bounds for the frequency assignment problem.
Discrete Mathematics, 167/168:571-582.
Smith and Palaniswami, 1997
Smith, K. A. and Palaniswami, M. (1997).
Static and dynamic channel assignment using neural networks.
IEEE Journal on Selected Areas in Communications, 15:238-249.
Sung and Wong, 1997
Sung, C. W. and Wong, W. S. (1997).
Sequential packing algorithm for channel assignment under cochannel and adjacent
channel interference constraint.
IEEE Transactions on Vehicular Technology, 46:676-685.
Tcha et al., 1997
Tcha, D., Chung, Y., and Choi, T. (1997).
A new lower bound for the frequency assignment problem.
IEEE/ACM Transactions on Networking, 5:34-39.
Warners, 1997
Warners, J. P. (1997).
A nonlinear approach to a class of combinatorial optimziation problems.
Statistica Neerlandica, 52(2):162-184.
Warners et al., 1997
Warners, J. P., Terlaky, T., Roos, C., and Jansen, B. (1997).
A potential reduction approach to the frequency assignment problem.
Discrete Applied Mathematics, 78:251-282.
Zerovnik, 1997
Zerovnik, J. (1997).
Experiments with a randomized algorithm for a frequency assignment problem.
Technical Report 97-27, Ecole Normale Supérieure de Lyon.
Zürbes, 1997
Zürbes, S. (1997).
Frequency Assignment in Cellular Radio by Stochastic Optimization.
In EPMCC'97, pages 135-142. VDE.
1996
Aardal et al., 1996a
Aardal, K. I., Hipolito, A., Hoesel, C. P. M. v., and Jansen, B. (1996a).
A branch-and-cut algorithm for the frequency assignment problem.
Research Memorandum 96/011, Maastricht University.
Available at http://www-edocs.unimaas.nl/abs/rm96011.htm.
Aardal et al., 1996b
Aardal, K. I., Hurkens, C. A. J., Lenstra, J. K., and Tiourine, S. R. (1996b).
Algorithms for frequency assignment problems (extended abstract).
CWI Quarterly, 9:1-8.
Castelino et al., 1996
Castelino, D. J., Hurley, S., and Stephens, N. M. (1996).
A tabu search algorithm for frequency assignment.
Annals of Operations Research, 63:301-319.
Castelino and Stephens, 1996
Castelino, D. J. and Stephens, N. M. (1996).
Tabu thresholding for the frequency assignment problem.
In Osman, I. H. and Kelly, J. P., editors, Meta-Heuristics. Theory and Applications,
chapter 22, pages 343-359. Kluwer Academic Publishers.
Dorne and Hao, 1996
Dorne, R. and Hao, J.-K. (1996).
Constraint handling in evolutionary search: A case study of the frequency assignment.
Lecture Notes in Computer Science, 1141:801-810.
Federtsov and Tsybakov, 1996
Federtsov, S. P. and Tsybakov, B. S. (1996).
Channel assignment in cellular networks.
Problems of Information Transmission, 32:78-85.
.
Haberland, 1996
Haberland, D. (1996).
Azyklische Subdigraphenprobleme und Frequenzzuweisung im Mobilfunk.
Master's thesis, Technische Universität Berlin, Fachbereich Mathematik.
Hao and Dorne, 1996
Hao, J.-K. and Dorne, R. (1996).
Study of genetic search for the frequency assignment problem.
Lecture Notes in Computer Science, 1063:333-344.
Hebermehl, 1996
Hebermehl, M. (1996).
Heuristische Algorithmen zur Lösung von Färbungsproblemen im Mobilfunk.
Master's thesis, Technische Universität Berlin, Fachbereich Mathematik.
Jaimes-Romero et al., 1996
Jaimes-Romero, F. J., Munoz-Rodriguez, D., and Tekinay, S. (1996).
Channel assignment in cellular systems using genetic algorithms.
In Proceedings of the 46th IEEE Vehicular Technology Conference, pages 741-745,
Atlanta, USA.
Katzela and Naghshineh, 1996
Katzela, I. and Naghshineh, M. (1996).
Channel assignment schemes for cellular mobile telecommunication systems.
Personal Communications Magazine.
Kim et al., 1996a
Kim, J.-S., Park, S., Dowd, P., and Nasrabadi, N. (1996a).
Cellular radio channel assignment using a modified hopfield network.
IEEE transactions on vehicular technology, 46(4):957-967.
Kim et al., 1996b
Kim, J.-S., Park, S., Dowd, P., and Nasrabadi, N. (1996b).
Channel assignment in cellular radio using genetic algorithms.
Wireless Personal Communications, 3:273-286.
Lai and Coghill, 1996
Lai, W. K. and Coghill, G. G. (1996).
Channel assignment through evolutionary optimization.
IEEE Transactions on Vehicular Technology, 45:91-95.
Leese, 1996
Leese, R. A. (1996).
Tiling methods for channel assignment in radio communication networks.
ZAMM - Zeitschrift für Angewandte Mathematik und Mechanik, 76:303-306.
Liu, 1996
Liu, D. D.-F. (1996).
T-graphs and the channel assignment problem.
Discrete Mathematics, 161:197-205.
Malesinska and Panconesi, 1996
Malesinska, E. and Panconesi, A. (1996).
On the hardness of allocating frequencies for hybrid networks.
Technical Report 498, Technische Universität Berlin
Park and Lee, 1996
Park, T. and Lee, C. Y. (1996).
Application of the graph coloring algorithm to the frequency assignment problem.
Journal of the Operations Research Society of Japan, 39:258-265.
Re et al., 1996
Re, E. D., Fantacci, R., and Ronga, L. (1996).
A synamic channel allocaiton technique based on hopfield neural networks.
IEEE Transactions on Vehicular Technology, 45:26-32.
Verfaillie et al., 1996
Verfaillie, G., Lemaître, M., and Schiex, T. (1996).
Russian doll search for solving constraint optimization problems.
In Proceedings of the 13th National Conference on Artificial Intelligence (AAAI-96),
pages 181-187, Portland, OR, USA.
Wang and Rushforth, 1996
Wang, W. and Rushforth, C. K. (1996).
An adaptive local-search algorithm for the channel-assignment problem (CAP).
IEEE Transactions on Vehicular Technology, 45:459-466.
Walser, 1996
Walser, J. P. (1996).
Feasible cellular frequency assignment using constraint programming abstractions.
In Proceedings of the Workshop on Constraint Programming Applications (CP96),
Cambridge, Massachusetts, USA.
1995
Benthem, 1995
Benthem, H. P. v. (1995).
GRAPH generating radio link frequency assignment problems heuristically.
Master's thesis, Delft University of Technology.
Bouju et al., 1995a
Bouju, A., Boyce, J. F., Dimitropoulos, C. H. D., Scheidt, G. V., and Taylor, J. G.
(1995a).
Tabu search for the radio links frequency assignment problem.
In Applied Decision Technologies (ADT'95), London.
Bouju et al., 1995b
Bouju, A., Boyce, J. F., Dimitropoulos, C. H. D., Scheidt, G. V., Taylor, J. G., Likas, A.,
Papageorgiou, G., and Stafylopatis, A. (1995b).
Intellegent search for the radio links frequency assignment problem.
In Int. Conf. For Digital Signal Processing (DSP'95), Limassol, Cypres.
Comellas and Ozón, 1995
Comellas, F. and Ozón, J. (1995).
Graph coloring algorithms for assignment problems in radio networks.
Applications of Neural Networks to Telecommunications, 2:49-56.
Dahl et al., 1995
Dahl, G., Jörnsten, K., Løvnes, G., and Svaet, S. (1995).
Graph optimization problems in connection with the management of mobile
communications systems.
Telecommunication Systems, 3:319-339.
Dorne and Hao, 1995
Dorne, R. and Hao, J.-K. (1995).
An evolutionary approach for frequency assignment in cellular radio networks.
In IEEE Int. Conference on Evolutionary Computing, Perth, Australia.
Hurkens and Tiourine, 1995
Hurkens, C. A. J. and Tiourine, S. R. (1995).
Upper and lower bounding techniques for frequency assignment problems.
Technical Report COSOR 95-34, Eindhoven University of Technology.
Available at http://www.win.tue.nl/math/bs/comb_opt/hurkens/calma.html.
Hurley and Smith, 1995
Hurley, S. and Smith, D. (1995).
Fixed spectrum frequency assignment unsing natural algorithms.
In Proceedings of the first conference on genetic algorithms in engineering systems,
pages 373-378, Sheffield.
Kapsalis et al., 1995a
Kapsalis, A., Chardaire, P., Rayward-Smith, V. J., and Smith, G. D. (1995a).
The radio link frequency assignment problem: A case study using genetic algorithms.
Lecture Notes on Computer Science, 993:117-131.
Kapsalis et al., 1995b
Kapsalis, A., Rayward-Smith, V. J., and Smith, G. D. (1995b).
Using genetic algorithms to solve the radio link frequency assignment problem.
In Pearson, D. W., Steele, N. C., and Albrecht, R. F., editors, Proceedings of the Second
International Conference on Artificial Neural Networks and Genetic Algorithms.
Springer Verlag.
Kazantzakis et al., 1995
Kazantzakis, M. G., Demestichas, P. P., and Anagnostou, M. E. (1995).
Optimum frequency reuse in mobile telephone systems.
International Journal of Communications Systems, 8:185-190.
Lochtie and Mehler, 1995a
Lochtie, G. D. and Mehler, M. J. (1995a).
Channel assignment using a subspace approach to neural networks.
IEE Conference Publication, 407:296-300.
Lochtie and Mehler, 1995b
Lochtie, G. D. and Mehler, M. J. (1995b).
Subspace approach to channel assignment in mobile communication networks.
IEE Proceedings, 142:179-185.
Malesinska, 1995
Malesinska, E. (1995).
List coloring and optimization criteria for a channel assignment problem.
Technical Report 458, Technische Universität Berlin.
Quellmalz et al., 1995
Quellmalz, A., Knälmann, A., and Müller, B. (1995).
Efficient frequency assignment with simulated annealing.
IEE conference publication, 407-2:301-304.
Rouskas et al., 1995
Rouskas, A. N., Kazantzakis, M. G., and Anagnostou, M. E. (1995).
Optimal channel assignment in cellular networks.
International Journal of Communication Systems, 8:359-364.
Tiourine et al., 1995
Tiourine, S. R., Hurkens, C. A. J., and Lenstra, J. K. (1995).
An overview of algorithmic approaches to frequency assignment problems.
In Calma Symposium on Combinatorial Algorithms for Military Applications, pages 5362.
Available at http://www.win.tue.nl/math/bs/comb_opt/hurkens/calma.html
Warners, 1995
Warners, J. P. (1995).
A potential reduction approach to the radio link frequency assignment problem.
Master's thesis, Delft University of Technology.
Youngs, 1995
Youngs, D. (1995).
Frequency assignment for cellular radio networks.
IEE Conference Publication, 404:179-183.
1994
Cuppini, 1994
Cuppini, M. (1994).
A genetic algorithm for channel assignment problems.
European Transactions on telecommunications and related technologies, 5:285-294.
Griggs and Liu, 1994
Griggs, J. R. and Liu, D. D.-F. (1994).
The channel assignment problem for mutually adjacent sites.
Journal of Combinatorial Theory. Series A, 68:169-183.
Johri, 1994
Johri, P. K. (1994).
An insight into dynamic channel assignment in cellular mobile communications systems.
European Journal of Operational Research, 74:70-77.
Kim and Chang, 1994
Kim, S. and Chang, K.-N. (1994).
Optimal channel allocation for cellular mobile systems with nonuniform traffic
distribution.
INFOR, 32:203-213.
Kim and Kim, 1994
Kim, S. and Kim, S.-L. (1994).
A two-phase algorithm for frequency assignment in cellular mobile systems.
IEEE Transactions on Vehicular Technology, 43:542-548.
Knälmann and Quellmalz, 1994
Knälmann, A. and Quellmalz, A. (1994).
Solving the frequency assignment problem with simulated annealing.
IEE conference publication, 396:233-240.
Kolen et al., 1994
Kolen, A. W. J., Hoesel, C. P. M. v., and Wal, R. v. d. (1994).
A constraint satisfaction approach to the radio link frequency assignment problem.
Technical Report 2.2.2, EUCLID CALMA project.
Plehn, 1994
Plehn, J. (1994).
Applied Frequency Assignment.
In Proceedings of the IEEE Vehicular Technology Conference. IEEE.
Rundfunktechnische Mitteilungen, 37(1):18-31.
Raychaudhuri, 1994
Raychaudhuri, A. (1994).
Further results on t-coloring and frequency assignment problems.
SIAM Journal on Discrete Mathematics, 7:605-613.
W. Crompton and Stephens, 1994
W. Crompton, S. H. and Stephens, N. (1994).
A parallel genetic algorithm for frequency assignment problems.
In Proceedings IMACS/IEEEInt. Symp. on Signal Processing, Robotics and Neural
Networks, pages 81-84, Lille, France.
Werra and Gay, 1994
Werra, D. D. and Gay, Y. (1994).
Chromatic scheduling and frequency assignment.
Discrete Applied Mathematics, 49:165-174.
Yung and Yum, 1994
Yung, K. and Yum, T. (1994).
Compact pattern based dynamic channel assignment for cellular mobile systems.
IEEE Transactions on Vehicular Technology, 43:892-896.
1993
Carlsson and Grindal, 1993
Carlsson, M. and Grindal, M. (1993).
Automatic frequency assignment for cellular telephones using constraint satisfaction
techniques.
In Proceedings of the Tenth International Conference on Logic Programming, pages 648665.
Costa, 1993
Costa, D. (1993).
On the use of some known methods for t-colourings of graphs.
Annals of Operations Research, 41:343-358.
Duque-Antón et al., 1993
Duque-Antón, M., Kunz, D., and Rüber, B. (1993).
Channel assignment for cellular radio using simulated annealing.
IEEE Transactions on Vehicular Technology, 42:14-21.
Jansen and Scheffler, 1993
Jansen, K. and Scheffler, P. (1993).
Generalized coloring for tree-like graphs.
Mathar and Mattfeldt, 1993
Mathar, R. and Mattfeldt, J. (1993).
Channel assignment in cellular radio networks.
IEEE Transactions on Vehicular Technology, 42:647-656.
Quellmalz et al., 1993
Quellmalz, A., Knälmann, A., and Krank, W. (1993).
Simulated Annealing als Werkzeug der Sendernetzplanung.
Tesman, 1993
Tesman, B. A. (1993).
List -colorings.
Discrete Appied Mathematics, 45:277-289.
Tiourine, S. R. (1999).
Decision Support by Combinatorial Optimization: Case Studies.
PhD thesis, Eindhoven University of Technology.
Yeung and Yum, 1993
Yeung, K. and Yum, T. (1993).
The optimization of nominal channel allocaiton in cellular mobile systems.
In Proceedings of the IEEE ICC, pages 915-919.
1992 and before
Allen et al., 1987
Allen, J. D., Helgason, R. V., and Kennington, J. L. (1987).
The frequency assignment problem: A solution via nonlinear programming.
Naval Research Logistics, 34:133-139.
Anderson, 1973
Anderson, L. G. (1973).
A simulation study of some dynamic channel assignment algorithms in a high capacity
mobile telecommunications system.
IEEE Transactions on Communications, 21:1294-1301.
Baybars, 1982
Baybars, I. (1982).
Optimal assignment of broadcasting frequencies.
European Journal of Operations Research, 9:257-263.
Box, 1978
Box, F. (1978).
A heuristic technique for assigning frequencies to mobile radio nets.
IEEE Transactions on Vehicular Technology, 27:57-74.
Brélaz, 1979
Brélaz, D. (1979).
New methods to color the vertices of a graph.
Communications of the ACM, 22:251-256.
Bucher et al., 1987
Bucher, S., Liebling, T. M., Telley, H., and Giroux, M. (1987).
Broadcast frequency channel allocation minimizing interferences as applied to latin
america.
EPF-Laussane, UIT-Genève.
Chiba et al., 1992
Chiba, K., Takahata, F., and Nohara, M. (1992).
Theory and Performace of Frequency Assignment Schemes for Carriers with Different
Bandwiths under Demand Assignment SCPC/FDMA Operation.
IEICE Trans. Commun., E-75-B(6):476-486.
Cozzens and Roberts, 1982
Cozzens, M. B. and Roberts, F. S. (1982).
T-colorings of graphs and the channel assignment problem.
Congressus Numerantium, 35:191-208.
Cozzens and Wang, 1984
Cozzens, M. B. and Wang, D. I. (1984).
The general channel assignment problem.
Congressus Numerantium, 41:115-129.
Duque-Antón and Kunz, 1990
Duque-Antón, M. and Kunz, D. (1990).
Channel Assignment based on Neural Network Algorithms.
In Proc. DMR IV, pages 5.4.1-5.4.9, Oslo, Norway.
Erdos et al., 1979
Erdos, P., Rubin, A. L., and Taylor, H. (1979).
Choosability in graphs.
Congressus Numerantium, 26:125-157.
Freuder and Wallace, 1992
Freuder, E. C. and Wallace, R. J. (1992).
Partial constraint satisfaction.
Artificial Intelligence, 58:21-70.
Funabiki and Takefuji, 1992
Funabiki, N. and Takefuji, Y. (1992).
A neural network parallel algorithm for channel assignment problems in cellular radio
networks.
IEEE Transactions on Vehicular Technology, 41:430-437.
Gamst, 1986
Gamst, A. (1986).
Some lower bounds for a class of frequency assignment problems.
IEEE Transactions on Vehicular Technology, 35:8-14.
Gamst, 1988
Gamst, A. (1988).
A Resource Allocation Techinque for FDMA Systems.
Alta Frequenza, LVII(2):89-96.
Gamst and Rave, 1982
Gamst, A. and Rave, W. (1982).
On frequency assignment in mobile automatic telephone systems.
In Proceedings of GLOBECOM'82. IEEE.
Gupta et al., 1979
Gupta, U. I., Lee, D. T., and Leung, J. Y.-T. (1979).
An optimal solution for the channel-assignment problem.
IEEE Trans. Comput., C-28:807-810.
Hale, 1980
Hale, W. K. (1980).
Frequency assignment: Theory and applications.
Proceedings of the IEEE, 68:1497-1514.
Hao et al., 1998
Hao, J.-K., Dorne, R., and Galinier, P. (1998).
Tabu search for frequency assignment in moblie radio networks.
Journal of Heuristics, 4:47-62.
Hong and Rappaport, 1985
Hong, D. and Rappaport, S. (1985).
Heuristic channel assignments for cellular land mobile radio systems.
In Proceedings of the IEEE GLOBECOM, pages 997-1001.
Kubale, 1992
Kubale, M. (1992).
Some results concerning the complexity of restricted colorings of graphs.
Discrete Applied Mathematics, 36:35-46.
Kunz, 1991
Kunz, D. (1991).
Channel assignment for cellular radio using neural networks.
IEEE Transactions on Vehicular Technology, 40:188-193.
Lanfear, 1989
Lanfear, T. A. (1989).
Graph theory and radio frequency assignment.
Technical Report NATO Unclassified, Allied Radio Frequency Agency (ARFA).
Lee and Leung, 1984
Lee, D. T. and Leung, J. Y.-T. (1984).
On the 2-dimensional channel assignment problem.
IEEE Trans. Comput., C-33:2-6.
Metzger, 1970
Metzger, B. H. (Fall 1970).
Spectrum management technique.
Presentation at 38th National ORSA meeting (Detroit, MI).
Rabinowitz and Proulx, 1985
Rabinowitz, J. H. and Proulx, V. K. (1985).
An asymptotic approach to the channel assignment problem.
SIAM J. Algebraic Discrete Methods, 6:507-518.
Raychaudhuri, 1985
Raychaudhuri, A. (1985).
Intersection Assignments, T-Colourings and Powers of Graphs.
PhD thesis, Rutgers University.
Raychaudhuri, 1992
Raychaudhuri, A. (1992).
Optimal multiple interval assignments in frequency assignment and traffic planning.
Discrete Applied Mathematics, 40:319-332.
Roberts, 1979
Roberts, F. S. (1979).
On the mobile radio frequency assignment problem and the traffic light phasing problem.
Annals of New York Academy of Sciences, 319:466-483.
Roberts, 1991
Roberts, F. S. (1991).
-colorings of graphs: Recent results and open problems.
Discrete Mathematics, 93:229-245.
Robinson, 1992
Robinson, D. (1992).
The optimality of fixed channel assignment policies for cellular radio systems.
Adv. Appl. Probab., 24(2):474-495.
Simon, 1989
Simon, H. U. (1989).
Approximation algorithms for channel assignment in cellular radio networks.
In Fundamentals of computation theory, volume 380 of Lecture Notes in Computer
Science, pages 405-415. Springer-Verlag.
Sivarajan et al., 1989
Sivarajan, K., McEliece, R., and Ketchum, J. (1989).
Channel assignment in cellular radio.
In Proceedings of the 39th IEEE Vehicular Technology Conference, pages 846-850.
Stahl, 1976
Stahl, S. (1976).
-tuple colorings and associated graphs.
Journal of Combinatorial Theory, 20:185-203.
Tesman, 1989
Tesman, B. A. (1989).
-colorings, list -colorings, and set -colorings of graphs.
PhD thesis, Department of Mathematics, Rutgers University.
Tesman, 1990a
Tesman, B. A. (1990a).
Applications of forbidden difference graphs to
Congrussus Numerantium, 74:15-24.
-colorings.
Tesman, 1990b
Tesman, B. A. (1990b).
Set -colorings.
Congrussus Numerantium, 77:229-242.
Thuve, 1981
Thuve, H. (1981).
Frequency planning as a set partitioning problem.
European Journal of Operational Research, 6:29-37.
Zhang and Yum, 1991
Zhang, M. and Yum, T. (1991).
The nonuniform compact pattern allocation algorithm for cellular mobile systems.
IEEE Transactions on Vehicular Technology, 40:387-391.