{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T17:38:03Z","timestamp":1764783483886},"publisher-location":"Boston, MA","reference-count":95,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9781441948137"},{"type":"electronic","value":"9781475730234"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/978-1-4757-3023-4_6","type":"book-chapter","created":{"date-parts":[[2013,2,21]],"date-time":"2013-02-21T08:28:50Z","timestamp":1361435330000},"page":"295-377","source":"Crossref","is-referenced-by-count":43,"title":["Frequency Assignment Problems"],"prefix":"10.1007","author":[{"given":"Robert A.","family":"Murphey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mauricio G. C.","family":"Resende","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","unstructured":"K.I. Aardal, A. Hipolito, C.P.M. Van Hoesel, B. Jansen, C. Roos and T. Terlaky, A branch-and-cut algorithm for the frequency assignment problem, EUCLID CALMA Project,Delft and Eindhoven Universities of Technology, The Netherlands, (1995)"},{"key":"6_CR2","volume-title":"John Wiley and Sons","author":"E Aarts","year":"1989","unstructured":"E. Aarts and J. Korst, Simulated Annealing and Boltzman Machines: A Stochastic Approach To Combinatorial Optimization and Neural Computing, John Wiley and Sons (1989)."},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/0377-2217(82)90033-9","volume":"9","author":"I Baybars","year":"1982","unstructured":"I. Baybars, Optimal assignment of broadcasting frequencies, European Journal of Operations Research, Vol. 9, (1982) pp. 257\u2013263.","journal-title":"European Journal of Operations Research"},{"key":"6_CR4","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0196-6774(85)90044-6","volume":"6","author":"E. A. Bender","year":"1985","unstructured":"E. A. Bender and H. S. Wilf, A theoretical analysis of backtracking in the graph coloring problem, Journal of Algorithms 6, (1985), pp. 275\u2013282.","journal-title":"Journal of Algorithms"},{"key":"6_CR5","volume-title":"Graph: Generating radio link frequency assignment problems heuristically, Masters Thesis, Faculty of Technical Mathematics and Informatics, Delft University","author":"HP Benthem","year":"1995","unstructured":"H.P. Benthem, GRAPH: Generating radio link frequency assignment problems heuristically, Master\u2019s Thesis, Faculty of Technical Mathematics and Informatics, Delft University, Delft, The Netherlands, (1995)."},{"key":"6_CR6","volume-title":"Euclid Calma technical report, GRAPH: a test case generator, generating radiolink frequency assignment problems heuristically, Euclid Calma Project","author":"H Benthem","year":"1995","unstructured":"H. van Benthem, A. Hipolito, B. Jansen, C. Roos, T. Terlaky and J. Warners, EUCLID CALMA technical report, GRAPH: a test case generator, generating radiolink frequency assignment problems heuristically, EUCLID CALMA Project, Delft and Eindhoven Universities of Technology, The Netherlands, (1995)."},{"key":"6_CR7","volume-title":"Graph, a test problem generator for the radiolink frequency assignment problem, Euclid Calma Project Supplemental Report 2.3.2a","author":"H Benthem","year":"1995","unstructured":"H. van Benthem, A. Hipolito, B. Jansen, C. Roos, T. Terlaky and J. Warners, GRAPH, a test problem generator for the radiolink frequency assignment problem, EUCLID CALMA Project Supplemental Report 2.3.2a:, Delft and Eindhoven Universities of Technology, The Netherlands, (1995)."},{"key":"6_CR8","unstructured":"L.A. Berry and D. H. Cronin, The spectrum cost of frequency distance rules, IEEE International Symposium on Electromagnetic Compatibility, (1983) pp. 75\u201378."},{"key":"6_CR9","unstructured":"D.P. Bertsekas and R. G. Gallager, Data Networks, 2nd ed, (Prentice-Hall, 1992 )."},{"key":"6_CR10","unstructured":"B. Bollob\u00e2s and A. J. Harris, List colorings of graphs, Graphs and Combinatoricsl, (1985) pp. 115\u2013187"},{"key":"6_CR11","volume-title":"T-colorings of complete graphs, Ph.D. Thesis, Department of Mathematics","author":"I Bonias","year":"1991","unstructured":"I. Bonias, T-colorings of complete graphs, Ph.D. Thesis, Department of Mathematics, Northeastern University, Boston, MA (1991)."},{"key":"6_CR12","unstructured":"A. Bouju, J.F. Boyce, C.H.D. Dimitropoulis, G. vom Scheidt, and J.G. Taylor, Tabu search for the radio link frequency assignment problem, Applied Decision Technologies, London [ADT951, UNICOM Conference, (1995)."},{"key":"6_CR13","unstructured":"F. Box, A heuristic technique for assigning frequencies to mobile radio nets, IEEE Trans. Vehicular Technology, Vol. VT-27, (1978), pp. 57\u201374."},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1145\/359094.359101","volume":"22","author":"D Brelaz","year":"1979","unstructured":"D. Brelaz, New methods to color the vertices of a graph, Communications ACM, Vol. 22, (1979) pp. 251\u2013256.","journal-title":"Communications Acm"},{"key":"6_CR15","unstructured":"S.H. Cameron, The solution of the graph coloring problem as a set covering problem, IEEE Transactions on Electromagnetic Compatibility, Vol EMC-19, (1973) pp. 320\u2013322."},{"key":"6_CR16","first-page":"72","volume":"198","author":"F Carmassi","year":"1983","unstructured":"F. Carmassi and L. Tornati, A theory of frequency assignment in broadcasting network planning, European Broadcast Union Technical Review, No. 198, (Apr. 1983) pp. 72\u201381.","journal-title":"European Broadcast Union Technical Review"},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/BF02023000","volume":"41","author":"DJ Castelino","year":"1993","unstructured":"D.J. Castelino, S. Hurley and N.M. Stephens, A Tabu search algorithm for frequency assignment, Annals of Operations Research, Vol 41, (1993), pp. 343\u2013358.","journal-title":"Annals of Operations Research"},{"key":"6_CR18","volume-title":"Meta-heuristics: Theory and Applications","author":"D Castelino","year":"1996","unstructured":"D. Castelino and N. Stephens, Tabu thresholding for the frequency assignment problem, Meta-Heuristics: Theory and Applications (Edited by I.H. Osman and J.P. Kelly ), Kluwer Academic Publishers 1996."},{"key":"6_CR19","first-page":"63","volume":"21","author":"V Chv\u00e2tal","year":"1984","unstructured":"V. Chv\u00e2tal, Perfectly ordered graphs, Annals of Discrete Mathematics, 21, (1984) pp. 63\u201365.","journal-title":"Annals of Discrete Mathematics"},{"key":"6_CR20","volume-title":"Modern Communications Systems: Principles and Practices","author":"LW Couch","year":"1995","unstructured":"L.W. Couch, Modern Communications Systems: Principles and Practices, Prentice-Hall, Inc., (1995)."},{"key":"6_CR21","first-page":"191208","volume":"35","author":"M.B. Cozzens","year":"1982","unstructured":"M.B. Cozzens and F.S. Roberts, T-colorings of graphs and the channel assignment problem, Congressus Numerantium,Vol 35 (1982), pp. 191208.","journal-title":"Congressus Numerantium"},{"key":"6_CR22","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1137\/0603058","volume":"3","author":"MB Cozzens","year":"1982","unstructured":"M.B. Cozzens and F.S. Roberts, Double semiorders and double indifference graphs, SIAM Journal Algebraic Discrete Methods 3 (1982) pp. 566\u2013583.","journal-title":"Siam Journal Algebraic Discrete Methods"},{"issue":"4","key":"6_CR23","first-page":"286","volume":"16","author":"MB Cozzens","year":"1991","unstructured":"M.B. Cozzens and F.S. Roberts, Greedy algorithms for T-colorings of complete graphs and the meaningfulness of conclusions about them, Journal of Combinatorics, Information and System Sciences, Vol 16 No. 4, (1991), pp. 286\u2013299.","journal-title":"Journal of Combinatorics Information and System Sciences"},{"key":"6_CR24","first-page":"115","volume":"41","author":"MB Cozzens","year":"1984","unstructured":"M.B. Cozzens and D.I. Wang, The general channel assignment problem, Congressus Numerantium, Vol 41 (1984), pp. 115\u2013129.","journal-title":"Congressus Numerantium"},{"key":"6_CR25","volume-title":"Proceedings of Natural Algorithms in Signal Processing","author":"W Crompton","year":"1993","unstructured":"W. Crompton, S. Hurley and N.M. Stephens, Frequency assignment using a parallel genetic algorithm, Proceedings of Natural Algorithms in Signal Processing, (1993)."},{"key":"6_CR26","unstructured":"C.E. Dadson, J. Durkin and R.E. Martin, Computer prediction of field strength in the planning of radio systems, IEEE Trans. Vehicular Technology, Vol. VT-24, (1975), pp. 1\u20138."},{"key":"6_CR27","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0166-218X(94)90207-0","volume":"49","author":"D Werra","year":"1994","unstructured":"D. de Werra and Y. Gay, Chromatic scheduling and frequency assignment, Discrete Applied Mathematics 49, (1994) pp. 165\u2013174.","journal-title":"Discrete Applied Mathematics"},{"key":"6_CR28","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1137\/0608005","volume":"8","author":"JP Doignon","year":"1987","unstructured":"J. P. Doignon, Threshold representations of multiple semiorders, SIAM Journal Algebraic Discrete Methods 8 (1987) pp. 77\u201384.","journal-title":"Siam Journal Algebraic Discrete Methods"},{"key":"6_CR29","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/0095-8956(85)90039-5","volume":"39","author":"RB Eggleton","year":"1985","unstructured":"R.B. Eggleton, P. Erd\u00f6s and D.K. Skilton, Coloring the real line, Journal of Combinatorial Theory, Series B, 39, (1985), 86\u2013100.","journal-title":"Journal of Combinatorial Theory Series B"},{"key":"6_CR30","unstructured":"Eindhoven RLFAP Group, Radio link frequency assignment project, EUCLID CALMA Project Report 2.3.3 Local Search:, Eindhoven University of Technology, The Netherlands, (1995)."},{"key":"6_CR31","doi-asserted-by":"crossref","unstructured":"A. Eisenbl\u00e4tter, A frequency assignment problem in cellular phone networks (extended abstract), Network Design, Connectivity and Facility Location, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 35, American Mathematical Society (1997).","DOI":"10.1090\/dimacs\/040\/07"},{"key":"6_CR32","first-page":"125","volume":"26","author":"P Erd\u00f6s","year":"1979","unstructured":"P. Erd\u00f6s, A. L. Rubin and H. Taylor, Choosability in graphs, Congres-sus Numerantium 26, (1979), pp. 125\u2013157.","journal-title":"Congres-sus Numerantium"},{"key":"6_CR33","doi-asserted-by":"crossref","unstructured":"L.R. Foulds, Graph Theory Application, Springer-Verlag New York Inc., (1992).","DOI":"10.1007\/978-1-4612-0933-1"},{"key":"6_CR34","unstructured":"R.A. Frazier, Compatibility and the frequency selection problem, IEEE Trans. Electromagnetic Compatibility,Vol. EMC-17, (1975), pp. 248275."},{"key":"6_CR35","doi-asserted-by":"publisher","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","volume":"15","author":"DR Fulkerson","year":"1965","unstructured":"D. R. Fulkerson and O.A. Gross, Incidence matrices and interval graphs, Pacific Journal of Math 15, (1965) pp. 835\u2013855.","journal-title":"Pacific Journal of Math"},{"key":"6_CR36","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1137\/0402044","volume":"2","author":"Z F\u00fcredi","year":"1989","unstructured":"Z. F\u00fcredi, J. R. Griggs and D.J. Kleitinan, Pair labellings with given distance, SIAM Journal of Discrete Mathematics 2, (1989) pp. 491\u2013499.","journal-title":"Siam Journal of Discrete Mathematics"},{"key":"6_CR37","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1109\/T-VT.1986.24063","volume":"1","author":"A Gamst","year":"1986","unstructured":"A. Gamst, Some lower bounds for a class of frequency assignment problems, IEEE transactions on vehicular technology, Vol. VT-35, No. 1 (Feb. 1986), pp. 8\u201314.","journal-title":"Ieee transactions on vehicular technology, Vol. VT-35"},{"issue":"2","key":"6_CR38","first-page":"140","volume":"39","author":"A Gamst","year":"1990","unstructured":"A. Gamst and K. Ralf, Computational complexity of some interference graphs, IEEE Transactions on Vehicular Technology, Vol 39 No. 2, (1990) pp. 140\u2013149.","journal-title":"Vol"},{"key":"6_CR39","first-page":"309","volume":"1","author":"A Gamst","year":"1982","unstructured":"A. Gamst and W. Rave, On frequency assignment in mobile automatic telephone systems, GLOBCOM 82, IEEE Global Telecommunications Conference, Vol 1, (1982) pp. 309\u2013315.","journal-title":"Vol"},{"key":"6_CR40","unstructured":"M. R. Garey and D. S. Johnson, Computers and Intractability, A Guide To The Theory of NP-Completeness, W.H. Freeman and Company, New York, NY (1979)."},{"key":"6_CR41","doi-asserted-by":"crossref","first-page":"190206","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"F. Glover, Tabu search - Part I. ORSA Journal on Computing 1: 190206, 1989.","journal-title":"ORSA Journal on Computing"},{"key":"6_CR42","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F Glover","year":"1990","unstructured":"F. Glover, Tabu search\u2013Part II. ORSA Journal on Computing 2: 4\u201332, 1990.","journal-title":"Orsa Journal on Computing"},{"key":"6_CR43","unstructured":"F. Glover, Tabu Thresholding: Improved search strategies by non-monotonic search trajectories, ORSA Journal on Computing to appear."},{"key":"6_CR44","unstructured":"D.E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, Reading MA (1989)."},{"key":"6_CR45","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M Gr\u00f6tschel","year":"1981","unstructured":"M. Gr\u00f6tschel, L. Lov\u00e2sz, and A. Schrijver, The ellipsoid method and its consequences in combinatorial optimization, Combinatorica 1, (1981) 169\u2013197.","journal-title":"Combinatorica"},{"issue":"12","key":"6_CR46","doi-asserted-by":"publisher","first-page":"1497","DOI":"10.1109\/PROC.1980.11899","volume":"68","author":"WK Hale","year":"1980","unstructured":"W.K. Hale, Frequency assignment: theory and applications, Proc. of The IEEE Vol 68, No. 12, (1980) pp. 1497\u20131514.","journal-title":"Proc. of The Ieee Vol"},{"key":"6_CR47","unstructured":"W.K. Hale, New spectrum management tools, IEEE International Symposium on Electromagnetic Compatibility, Boulder, CO (1981) pp. 4753."},{"key":"6_CR48","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"F Harary","year":"1969","unstructured":"F. Harary, Graph Theory, Addison-Wesley Publishing Company, Reading, MA (1969)."},{"key":"6_CR49","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1016\/0167-6377(91)90043-O","volume":"10","author":"A Hertz","year":"1991","unstructured":"A. Hertz, COSINE: a new graph coloring algorithm, Operations Research Letters 10, (1991) pp. 411\u2013415.","journal-title":"Operations Research Letters"},{"key":"6_CR50","volume-title":"Adaptation in Natural and Artificial Systems","author":"H Holland","year":"1975","unstructured":"H. Holland, Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, MI (1975)."},{"key":"6_CR51","unstructured":"S. Hurley and D. H. Smith, Fixed spectrum frequency assignment using natural algorithms, Genetic Algorithms in Engineering Systems: Innovations and Applications, IEE Conference Publication No. 414, (1995)."},{"key":"6_CR52","volume-title":"Graph Coloring Problems","author":"TR Jensen","year":"1995","unstructured":"T.R. Jensen and B. Toft, Graph Coloring Problems, John Wiley and Sons, New York, (1995)."},{"key":"6_CR53","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/0377-2217(94)90204-6","volume":"74","author":"PK Johri","year":"1994","unstructured":"P.K. Johri, An insight into dynamic channel assignment in cellular mobile communications systems, European Journal of Operations Research, 74, (1994) pp. 70\u201377.","journal-title":"European Journal of Operations Research"},{"key":"6_CR54","unstructured":"N. Karmarkar, An interior point approach to NP-Complete problems - part 1, Contemporary Mathematics, Vol 114, (1990) pp. 297\u2013308."},{"key":"6_CR55","doi-asserted-by":"crossref","unstructured":"I. Katzela and M. Naghshineh, Channel assignment schemes for cellular mobile telecommunication systems: a comprehensive survey, IEEE Personal Communications (June 1996), pp. 10\u201331.","DOI":"10.1109\/98.511762"},{"key":"6_CR56","unstructured":"D. Karger, R. Motwani and M. Sudan, Approximate graph coloring by semidefinite programming, INCOMPLETE"},{"key":"6_CR57","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"S. Kirkpatrick, C.D, Gelatt, Jr., and M.P. Vecchi, Optimization by simulated annealing, Science, Vol 220, (1983) pp. 671\u2013680.","journal-title":"Science"},{"key":"6_CR58","unstructured":"Y. Kishi, T. Mizuike and F. Watanabe, A unified approach for frequency assignment of cellular mobile networks, Third Annual International Conference on Universal Personal Communications, San Diego, CA, (1994) pp. 563\u2013567."},{"key":"6_CR59","doi-asserted-by":"crossref","unstructured":"T. Kurokawa and S. Kozuka, Use of neural networks for the optimum frequency assignment problem, Electronics and Communications in Japan, Part 1, Vol, 77, No, 11, (1994).","DOI":"10.1002\/ecja.4410771110"},{"key":"6_CR60","unstructured":"T.A. Lanfear, Graph Theory and Radio Frequency Assignment, Technical Report, Allied Radio Frequency Agency NATO Headquarters, B1110, Brussels, Belgium, (1989)."},{"key":"6_CR61","unstructured":"D.S.P. Leung, Application of the partial backtracking technique to the frequency assignment problem, IEEE International Symposium on Electromagnetic Compatibility, Boulder, CO (1981) pp. 70\u201374."},{"key":"6_CR62","volume-title":"Department of Mathematics","author":"DD Liu","year":"1991","unstructured":"D. D. Liu, Graph homomorphisms and the channel assignment problem, Ph.D. Thesis, Department of Mathematics, University of South Carolina, Colombia, SC (1991)."},{"key":"6_CR63","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1145\/2402.322385","volume":"30","author":"DW Matula","year":"1983","unstructured":"D.W. Matula and L.L. Beck, Smallest-last ordering and clustering and graph coloring algorithms, Journal of The ACM, Vol. 30, (1983) pp. 417\u2013427.","journal-title":"Journal of The Acm"},{"key":"6_CR64","volume-title":"Mi","author":"BH Metzger","year":"1970","unstructured":"B.H. Metzger, Spectrum management technique, paper presented at the 38th National ORSA Meeting, Detroit, MI, (1970)."},{"key":"6_CR65","unstructured":"L.C. Middlecamp, UHF taboos\u2013history and development, IEEE Transactions on Consumer Electronics, Vol CE24, (1978) pp. 514\u2013519."},{"key":"6_CR66","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"GL Nemhauser","year":"1988","unstructured":"G.L. Nemhauser and L.A. Wolsey, Integer and Combinatorial Optimization, John Wiley and Sons, Inc., (1988)."},{"key":"6_CR67","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1002\/net.3230130302","volume":"13","author":"RJ Opsut","year":"1983","unstructured":"R.J. Opsut and F.S. Roberts, I-colorings, I-phasings, and I-intersection assignments for graphs, and their applications, Networks, Vol. 13 (1983) pp. 327\u2013345.","journal-title":"Networks"},{"key":"6_CR68","unstructured":"P.M. Pardalos, F. Rendl and H. Wolkowicz, The Quadratic Assignment Problem: A Survey and Recent Developments, Quadratic Assignment and Related Problems, Panos M. Pardalos and Henry Wolkowicz (eds.), DIMACS Series on Discrete Mathematics and Theoretical Computer Science,16 American Mathematical Society, (1994) pp. 317\u2013342."},{"key":"6_CR69","first-page":"595","volume":"8","author":"J Peem\u00f6ller","year":"1983","unstructured":"J. Peem\u00f6ller, A correction to Brelaz\u2019s modification of Brown\u2019s coloring algorithm, Communications of the ACM, Vol. 26, No. 8, (1983) pp. 595\u2013597.","journal-title":"Vol. 26"},{"key":"6_CR70","doi-asserted-by":"crossref","unstructured":"A. Quellmalz, A. Kn\u00e4lmann and B. M\u00fcller, Efficient frequency assignment with simulated annealing, IEE Ninth International Conference on Antennas and Propagation, Eindhoven, The Netherlands, Vol. 2, (1995).","DOI":"10.1049\/cp:19950437"},{"key":"6_CR71","volume-title":"T-coloring, and powers of graphs, Ph.D. Thesis, Department of Mathematics","author":"A Raychaudhuri","year":"1985","unstructured":"A. Raychaudhuri, Intersection assignments, T-coloring, and powers of graphs, Ph.D. Thesis, Department of Mathematics, Rutgers University, New Brunswick, NJ, (1985)."},{"key":"6_CR72","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1137\/S0895480189171746","volume":"7","author":"A. Raychaudhuri","year":"1994","unstructured":"A. Raychaudhuri, Further results on T-coloring and frequency assignment problems, SIAM Journal on Discrete Mathematics,Vol. 7 (1994), pp. 605\u2013613.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"6_CR73","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/0095-8956(71)90010-4","volume":"11","author":"FS Roberts","year":"1971","unstructured":"F.S. Roberts, On the Compatibility between a graph and a simple order, Journal Combinatorial Theory, 11 (1971), pp 28\u201338.","journal-title":"Journal Combinatorial Theory"},{"key":"6_CR74","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1111\/j.1749-6632.1979.tb32824.x","volume":"319","author":"FS Roberts","year":"1979","unstructured":"F.S. Roberts, On the mobile radio frequency assignment problem and the traffic light phasing problem, Annals of New York Academy of Sciences Vol. 319 (1979) pp 466\u2013483.","journal-title":"Annals of New York Academy of Sciences Vol"},{"key":"6_CR75","unstructured":"F.S. Roberts, From garbage to rainbows: generalizations of graph coloring and their applications, in Y. Alavi, G. Chartrand, O.R. Oellerman and A.J. Schwenk (eds.) Graph Theory, Combinatorics, and Applications, Vol. 2 ( Wiley, New York, 1991 ), pp. 1031\u20131052."},{"key":"6_CR76","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0012-365X(91)90258-4","volume":"93","author":"FS Roberts","year":"1991","unstructured":"F.S. Roberts, T-colorings of graphs: recent results and open problems, Discrete Math. 93, (1991) pp. 229\u2013245.","journal-title":"Discrete Math"},{"issue":"11","key":"6_CR77","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/0895-7177(93)90265-Z","volume":"17","author":"FS Roberts","year":"1993","unstructured":"F.S. Roberts, No-hole 2-distant colorings, Mathl. Comput. Modelling Vol. 17, No. 11 (1993) pp. 139\u2013144.","journal-title":"Mathl. Comput. Modelling"},{"key":"6_CR78","volume-title":"Ph.d. Thesis, Rutcor","author":"D Sakai","year":"1992","unstructured":"D. Sakai, Generalized graph colorings and unit interval graphs, Ph.D. Thesis, RUTCOR, Rutgers University, New Brunswick University, NJ (1992)."},{"key":"6_CR79","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0012-365X(93)90125-D","volume":"119","author":"D Sakai","year":"1993","unstructured":"D. Sakai and C. Wang, No-hole (r+1)-distant colorings, Discrete Math. 119, (1993), pp. 175\u2013189.","journal-title":"Discrete Math"},{"key":"6_CR80","unstructured":"S. S. Skiena, The Algorithm Design Manual, TELOS, Springer-Verlag New York Inc., (1998)."},{"key":"6_CR81","first-page":"205","volume":"25","author":"DH Smith","year":"1988","unstructured":"D.H. Smith, Graph coloring and frequency assignment, ARS Combinatorica, Vol. 25C, (1988) pp. 205\u2013212.","journal-title":"Vol"},{"key":"6_CR82","doi-asserted-by":"crossref","unstructured":"G.D. Smith, A. Kapsalis, V.J. Rayward-Smith, Radio link frequency assignment project, EUCLID CALMA Project Report 2.1 Genetic Algorithm Approaches to Solving the Radio Link Frequency Assignment Problem:, University of East Anglia, UK (1995).","DOI":"10.1007\/978-3-7091-7535-4_12"},{"key":"6_CR83","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0095-8956(76)90010-1","volume":"20","author":"S. Stahl","year":"1976","unstructured":"S. Stahl, n-tuple colorings and associated graphs, J. Combinatorial Theory 20 (1976) pp. 185\u2013203.","journal-title":"J. Combinatorial Theory"},{"key":"6_CR84","volume-title":"And set T-colorings of graphs, Ph.D. Thesis, Department of Mathematics","author":"BA Tesman","year":"1989","unstructured":"B.A. Tesman, T-colorings, list T-colorings, and set T-colorings of graphs, Ph.D. Thesis, Department of Mathematics, Rutgers University, New Brunswick, NJ, (1989)."},{"key":"6_CR85","first-page":"15","volume":"74","author":"BA Tesman","year":"1990","unstructured":"B.A. Tesman, Applications of forbidden difference graphs to T-colorings, Congrussus Numerantium 74 (1990) pp. 15\u201324.","journal-title":"Congrussus Numerantium"},{"key":"6_CR86","first-page":"229","volume":"77","author":"BA Tesman","year":"1990","unstructured":"B. A. Tesman, Set T-colorings, Congrussus Numerantium 77 (1990) pp. 229\u2013242.","journal-title":"Congrussus Numerantium"},{"key":"6_CR87","unstructured":"S. Tiourine, C. Hurkins and J. K. Lenstra, An overview of algorithmic approaches to frequency assignment problems, EUCLID CALMA Project Overview Report, Delft University of Technology, The Netherlands, (1995)."},{"key":"6_CR88","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0166-218X(94)00030-H","volume":"64","author":"D Sim","year":"1996","unstructured":"D. Sakai Troxell, No-hole k-tuple (r+1)-distant colorings, Discrete Applied Math. 64, (1996) pp. 67\u201385.","journal-title":"Discrete Applied Math"},{"key":"6_CR89","unstructured":"D. -I. Wang, The channel assignment problem and closed neighborhood containment graphs, Ph.D. Thesis, Northeastern University, Boston, MA (1985)."},{"key":"6_CR90","volume-title":"A Potential Reduction Approach to The Frequency Assignment Problem, Technical Report","author":"JP Warners","year":"1995","unstructured":"J.P. Warners, T. Terlaky, C. Roos and B. Jansen, A Potential Reduction Approach to The Frequency Assignment Problem, Technical Report 9598, Faculty of Technical Mathematics and Informatics, Delft University, Delft, The Netherlands, (1995)."},{"key":"6_CR91","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0166-218X(94)90207-0","volume":"49","author":"D Werra","year":"1994","unstructured":"D. Werra, Y. Gay, Chromatic scheduling and frequency assignment, Discrete Applied Math. 49, (1994) pp. 165\u2013174.","journal-title":"Discrete Applied Math"},{"key":"6_CR92","unstructured":"H.S. Wilf, Backtrack: an 0(1) expected time algorithm for the graph coloring problem, Information Processing Letters 18 (1984) pp. 119121."},{"key":"6_CR93","volume-title":"Mathematical model for the radio link frequency assignment problem, Euclid Calma Project","author":"A Wisse","year":"1994","unstructured":"A. Wisse, Mathematical model for the radio link frequency assignment problem, EUCLID CALMA Project, Delft University of Technology, The Netherlands, (1994)."},{"key":"6_CR94","unstructured":"J.A. Zoellner, Frequency assignment games and strategies, IEEE Transactions on Electromagnetic Compatibility,Vol EMC-15, (1973) pp. 191196."},{"key":"6_CR95","unstructured":"J.A. Zoellner and C.L. Beall, A breakthrough in spectrum conserving frequency assignment technology, IEEE Transactions on Electromagnetic Compatibility, Vol EMC-19, (1977) pp. 313\u2013319."}],"container-title":["Handbook of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4757-3023-4_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,6]],"date-time":"2024-05-06T09:22:35Z","timestamp":1714987355000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4757-3023-4_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9781441948137","9781475730234"],"references-count":95,"URL":"https:\/\/doi.org\/10.1007\/978-1-4757-3023-4_6","relation":{},"subject":[],"published":{"date-parts":[[1999]]}}}