Radio Link Frequency Assignment

Constraints

Volumn 4, Issue 1, 1999, Pages 79-89

  Cabon, B ^a   De Givry, S ^a   Lobjois, L ^a   Schiex, T ^b   Warners, J P ^c  

^a Department of Computer Science   (France)

^b Neurogastroenterology and Nutrition Unit   (France)

^c DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Benchmarks; Constraint satisfaction; Optimization; Radio link frequency assignment

Indexed keywords

EID: 0001844903     PISSN: 13837133     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1009812409930     Document Type: Article

References (21)

1. th IJCAI, Montréal, Canada.
2. Christian Bessière and Jean-Charles Régin (1996). MAC and combined heuristics: Two reasons to forsake FC (and CBJ?) on hard problems. In Proc. of the Second International Conference on Principles and Practice of Constraint Programming, Cambridge, MA.
3. th IJCAI, Montréal, Canada.
4. Ir. A.A.F. Bloemen (1992). Frequency assignment in mobile telecommunication networks. Technical report, Tech. Universiteit Eindhoven.
5. B. Cabon (1996). Problèmes d'optimisation combinatoire : évaluation de méthodes de la physique statistique. Thèse, ENSAE, Toulouse, France.
6. S. de Givry, G. Verfaillie, and T. Schiex (1997). Bounding the Optimum of Constraint Optimization Problems. In Proc. of the 3rd International Conference on Principles and Practice of Constraint Programming (CP-97), Schloss Hagenberg, Austria.
7. E.C. Freuder and R.J. Wallace (1992). Partial constraint satisfaction. Artificial Intelligence, 58:21-70.
8. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi (1983). Optimization by simulated annealing. Science, 220:671-680.
9. A. Kolen (1994). A constraint satisfaction approach to the radio link frequency assignment problem. Technical Report 2.2.2, EUCLID CALMA project, 1994. Available at ftp://ftp.win.tue.nl/pub/ techreports/CALMA/222.ps.
10. A. Kolen (1996). Results on infeasible instances of the RLFAP. Personal communication.
11. A. Kolen (forthcoming). A genetic algorithm for the partial binary satisfaction problem: An application to a frequency assignment problem. Technical report, University of Maastricht, Maastricht, The Netherlands.
12. T.A. Lanfear (1989). Graph theory and radio frequency assignment. Technical report, NATO, Allied Radio Frequency Agency.
13. A. K. Mackworth (1977). Consistency in networks of relations. Artificial Intelligence, 8:99-118.
14. C. Peterson and B. Soderberg (1989). A new method for mapping optimization problems onto neural networks. Int. Journal of Neural Systems, 1(1):3-22.
15. C. Roisnel (1993). Étude comparative d'outils de programmation par contraintes - synthèse et résultats. Technical Report ITES/555-93/RS 10539, CELAR.
16. th IJCAI, pages 631-637, Montréal, Canada.
17. T. Schiex, J.-C.. Régin, C. Gaspin, and G. Verfaillie (1996). Lazy arc consistency. In Proc. of AAAI-96, Portland, OR, AAAI Press.
18. S. Tiourine, C. Hurkens, and J.K. Lenstra (1995). An overview of algorithmic approaches to frequency assignment problems. Technical report, EUCLID CALMA project, Eindhoven University of Technology. Available at ftp://ftp.win.tue.nl/pub/techreports/CALMA/overview.ps.
19. H.P. Van Benthem (1995). GRAPH: Generating radio link frequency assignment problems heuristically. Master's thesis, Faculty of Technical Mathematics and Informatics, Delft University of Technology, Delft, The Netherlands.
20. D.E. Van den Bout and T.K. Miller (1989). Graph Partitioning using Annealed Neural Networks. In Proc. of IJCNN-89, pages 521-528, Washington.
21. J.P. Warners (1996). A nonlinear approach to a class of combinatorial optimization problems. Technical Report 96-119, Delft University of Technology, Delft, The Netherlands. To appear in Statistica Neerlandica.