A potential reduction approach to the frequency assignment problem

Discrete Applied Mathematics

Volumn 78, Issue 1-3, 1997, Pages 251-282

  Warners, J P ^a   Terlaky, T ^a   Roos, C ^a   Jansen, B ^b  

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b CQM BV   (Netherlands)

Author keywords

Binary programming; Combinatorial optimization; Frequency assignment; Interior point methods; Nonlinear optimization

Indexed keywords

EID: 0000455645     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(96)00139-4     Document Type: Article

References (26)

1. 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, CALMA project, Delft and Eindhoven Universities of Technology, The Netherlands (1995).
2. H.P. van Benthem, GRAPH: Generating Radio link frequency Assignment Problems Heuristically, Master's Thesis, Faculty of Technical Mathematics and Informatics, Delft University of Technology, The Netherlands (1995).
3. A.A.F. Bloemen, Frequency assignment in mobile telecommunication networks, Report of the post-graduate program 'Mathematics for Industry', Eindhoven University of Technology, Eindhoven, The Netherlands (1992).
4. I.I. Dikin, Iterative solution of problems of linear and quadratic programming, Dokl. Akad. Nauk SSSR 174 (1967) 747-748. Translated into English in Soviet Math. Dokl. 8 (1967) 674-675.
5. I.I. Dikin, Iterative solution of problems of linear and quadratic programming, Dokl. Akad. Nauk SSSR 174 (1967) 747-748. Translated into English in Soviet Math. Dokl. 8 (1967) 674-675.
6. O.E. Flippo and B. Jansen, Duality and sensitivity in nonconvex quadratic optimization over an ellipsoid, European J. Oper. Res. 94 (1996) 167-178.
7. A.P. Kamath, N.K. Karmarkar, K.G. Ramakrishnan and M.G.C. Resende, Computational experience with an interior point algorithm on the satisfiability problem, Ann. Oper. Res. 25 (1990) 43-58.
8. S.E. Karisch and F. Rendl, Semidefinite programming and graph equipartition, Report 302, CDLDO 5, Institut für Mathematik, Technische Universität Graz, Austria (1995).
9. N. Karmarkar, A new polynomial-time algorithm for linear programming, Combinatorica 4 (1984) 373-395.
10. N. Karmarkar, An interior-point approach to NP-complete problems - part I, Contemp. Math. 114 (1990) 297-308.
11. N. Karmarkar, M.G.C. Resende and K.G. Ramakrishnan, An interior point algorithm to solve computationally difficult set covering problems, Math. Programming 52 (1991) 597-618.
12. L.G. Khachiyan, A polynomial algorithm in linear programming, Dokl. Akad. Nauk SSSR 244 (1979) 1093-1096. Translated into English in Soviet Math. Dokl. 20 (1979) 191-194.
13. L.G. Khachiyan, A polynomial algorithm in linear programming, Dokl. Akad. Nauk SSSR 244 (1979) 1093-1096. Translated into English in Soviet Math. Dokl. 20 (1979) 191-194.
14. T.A. Lanfear, Graph theory and radio frequency assignment, Technical Report, Allied Radio Frequency Agency NATO Headquarters, B-1110 Brussels, Belgium (1989).
15. P.M. Pardalos and J. Xue, The maximum clique problem, J. Global Optim. 4 (1994) 301-328.
16. F. Rendl and H. Wolkowicz, A semidefinite framework for trust region subproblems with application to large scale minimization, CORR Report 94-32 (Revised), University of Waterloo, Canada (1996).
17. C.-J. Shi, A. Vannelli and J. Vlach, An improvement on Karmarkar's algorithm for integer programming, COAL Bull. 21 (1992) 23-28.
18. D.C. Sörensen, Newton's method with a model trust region modification, SIAM J. Numer. Anal. 19 (1982) 409-426.
19. S. Tiourine, C. Hurkens and J.K. Lenstra, Frequency assignment by local search, CALMA project, Department of Mathematics and Computing Science, Eindhoven university of Technology, Eindhoven, The Netherlands (1994).
20. S. Tiourine, C. Hurkens and J.K. Lenstra, An overview of algorithmic approaches to frequency assignment problems, CALMA project, Department of Mathematics and Computing Science, Eindhoven University of Technology, Eindhoven, The Netherlands (1995).
21. J.P. Warners, A potential reduction approach to the Radio Link Frequency Assignment Problem, Master's Thesis, Faculty of Technical Mathematics and Informatics, Delft University of Technology, The Netherlands (1995).
22. J.P. Warners, T. Terlaky, C. Roos and B. Jansen, Potential reduction algorithms for structured combinatorial optimization problems, Technical Report 95-88, Faculty of Technical Mathematics and Informatics, Delft University of Technology, The Netherlands (1995). Oper. Res. Lett., to appear.
23. J.P. Warners, T. Terlaky, C. Roos and B. Jansen, Potential reduction algorithms for structured combinatorial optimization problems, Technical Report 95-88, Faculty of Technical Mathematics and Informatics, Delft University of Technology, The Netherlands (1995). Oper. Res. Lett., to appear.
24. Y. Ye, On affine scaling algorithms for nonconvex quadratic programming, Math. Programming 56 (1992) 285-300.
25. Y. Zhang, LIPSOL - a MATLAB™ toolkit for linear programming interior-point solvers, Department of Mathematics and Statistics, University of Maryland Baltimore Country, Baltimore, Maryland (1994). FORTRAN subroutines written by E.G. Ng and B.W. Peyton (ORNL), J.W.H. Liu (Waterloo), and Y. Zhang (UMBC).
26. Y. Zhang, LIPSOL - a MATLAB™ toolkit for linear programming interior-point solvers, Department of Mathematics and Statistics, University of Maryland Baltimore Country, Baltimore, Maryland (1994). FORTRAN subroutines written by E.G. Ng and B.W. Peyton (ORNL), J.W.H. Liu (Waterloo), and Y. Zhang (UMBC).