Lower bounding techniques for frequency assignment

Discrete Mathematics

Volumn 197-198, Issue , 1999, Pages 41-52

  Allen, S M ^a   Smith, D H ^a   Hurley, S ^b  

^a UNIVERSITY OF GLAMORGAN   (United Kingdom)

^b CARDIFF UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002851467     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0012-365x(99)90037-7     Document Type: Article

References (14)

1. J.E. Beasley, Lagrangean relaxation, in: C.R. Reeves (Ed.), Modern Heuristic Techniques for Combinatorial Problems, Advanced Topics in Computer Science, Ch. 6, McGraw-Hill, New York, 1995, pp. 243-303.
2. A. Bouju, J.F. Boyce, C.H.D. Dimitropoulos, G. vom Schelit, J.G. Taylor, Tabu search for the radio links frequency assignment problem, Conf. on Applied Decision Technologies: Modern Heuristic Methods, Brunel University, 1995, pp. 233-250.
3. D. Costa, On the use of some known methods for T-colourings of graphs, Ann. Oper. Res. 41 (1993) 343-358.
4. M.L. Fisher, The lagrangean relaxation method for solving integer programming problems, Management Sci. 27(1) (1981) 1-18.
5. W.K. Hale, Frequency assignment: theory and applications, Proc. IEEE 68 (1980) 1497-1514.
6. S. Hurley, D.H. Smith, S.U. Thiel, FASoft: a system for discrete channel frequency assignment, Radio Sci. 32(5) (1997) 1921-1939.
7. D.S. Johnson, L.A. McGeoch, E.E. Rothberg, Asymptotic experimental analysis for the Held-Karp traveling salesman bound, Proc. 7th Annual ACM-SIAM Symp. on Discrete Algorithms, January 1996, pp. 341-350.
8. J.F. Pekny, D.L. Miller, A staged primal-dual algorithm for finding a minimum cost perfect two-matching in an undirected graph, ORSA J. Comput. 6(1) (1994) 68-81.
9. R.C. Prim, Shortest connection networks and some generalizations, Bell System Tech. J. 36 (1997) 1389-1401.
10. A. Raychaudhuri, Intersection assignments, T-colourings and powers of graphs, Ph.D. Thesis, Rutgers University, 1985.
11. D.H. Smith, S. Hurley, Bounds for the frequency assignment problem, Discrete Math. 167/168 (1997) 571-582.
12. D.H. Smith, S. Hurley, S.U. Thiel, Improving heuristics for the frequency assignment problem, European J. Oper. Res. 107 (1998) 76-86.
13. A. Volgenant, Symmetric traveling salesman problems, European J. Oper. Res. 49 (1990) 153-154. ftp://www.mathematik.uni-kl.de/pub/Math/ORSEP/VOLGENAN.ZIP.
14. T. Volgenant, R. Jonker, A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation, European J. Oper. Res. 9 (1982) 83-89.