Solving Frequency Assignment Problems with Constraint Programming

@inproceedings{Schulz2003SolvingFA,
  title={Solving Frequency Assignment Problems with Constraint Programming},
  author={M. Schulz},
  year={2003}
}
The topic of this diploma thesis is the solving of a Frequency Assignment Problem (FAP) in GSM radio networks by means of Constraint Programming. The task of frequency planning is the assignment of frequencies to base stations w.r.t. various constraints such that interference, which may have a substantial impact on the quality of the received signals, is avoided as far as possible. Constraint Programming is employed since currently applied heuristics aimed at interference minimization often… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 21 references

Algorithms for Constraint-Satisfaction Problems: A Survey

AI Magazine • 1992
View 7 Excerpts
Highly Influenced

The OPL Optimization Programming Language

P. van Hentenryck
1999
View 3 Excerpts
Highly Influenced

Frequenzplanung im Mobilfunk, in: DMV-Mitteilungen 1/2002, pages 18 ff

A. Eisenblätter, M. Grötschel, A.M.C.A. Koster
2002
View 2 Excerpts

Puget: Program 6= Program: Constraint Programming and its Relationship to Mathematical Programming, the Institute for Operations Research and the Management Science (INFORMS)

I. J. Lustig, J.-F
Elkridge Landing Road, Suite 400, • 2001
View 2 Excerpts

Similar Papers

Loading similar papers…