N. W. Dunkin, J. E. Bater, P. G. Jeavons and D. A. Cohen, \Towards High Order Constraint Representations for the Frequency Assignment Problem", Technical Report CSD-TR-98-05, June, 1998. http://www.dcs.rhbnc.ac.uk/research/constraints/publications/index.shtml. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Conflict-Free Colorings of Simple Geometric Regions.. - Even, Lotker, Ron.. (2002) (1 citation) (Correct)
....on every edge. A typical cost function is the number of frequencies used. CF coloring cannot be modeled in this fashion because CF coloring allows for con icts between base stations provided that another base station serves the area of con ict . Even models that use non binary constraints (see [DBJC98]) do not capture CF coloring. We note that the above models take into account interferences between close frequencies, while we have ignored this issue for sake of simplicity. We can however incorporate some variants of such constraints. For example, in the case of unit disks we can easily impose ....
N. W. Dunkin, J. E. Bater, P. G. Jeavons and D. A. Cohen, \Towards High Order Constraint Representations for the Frequency Assignment Problem", Technical Report CSD-TR-98-05, June, 1998. http://www.dcs.rhbnc.ac.uk/research/constraints/publications/index.shtml.
Conflict-Free Colorings of Simple Geometric Regions.. - Even, Lotker, Ron.. (2002) (1 citation) (Correct)
....on every edge. A typical cost function is the number of frequencies used. CF coloring cannot be modeled in this fashion because CF coloring allows for con icts between base stations provided that another base station serves the area of con ict . Even models that use non binary constraints (see [DBJC98]) do not capture CFcoloring. We note that the above models take into account interferences between close frequencies, while we have ignored this issue for sake of simplicity. We can however incorporate some variants of such constraints. For example, in the case of unit disks we can easily impose ....
N. W. Dunkin, J. E. Bater, P. G. Jeavons and D. A. Cohen, \Towards High Order Constraint Representations for the Frequency Assignment Problem", Technical Report CSD-TR-98-05, June, 1998. http://www.dcs.rhbnc.ac.uk/research/constraints/publications/index.shtml.
Conflict-Free Colorings of Unit Disks - Even, Lotker, Ron (2002) (Correct)
....on every edge. A typical cost function is the number of frequencies used. CF coloring cannot be modeled in this fashion because CF coloring allows for conflicts between base stations provided that another base station serves the area of conflict . Even models that use non binary constraints (see [DBJC98]) do not capture CF coloring. We note that the above models take into account interferences between close frequencies, while we have ignored this issue for sake of simplicity. We can however incorporate some variants of such constraints. For example, we can impose the constraint that for every ....
N.W.Dunkin, J.E.Bater, P.G.Jeavons and D.A.Cohen, "Towards High Order Constraint Representations for the Frequency Assignment Problem", Technical Report CSD-TR98 -05, June, 1998. http://www.dcs.rhbnc.ac.uk/research/constraints/ publications/index.shtml
Models and Solution Techniques for Frequency.. - Aardal, Van Hoesel.. (2001) (4 citations) (Correct)
....fact that multiple signals may disturb communication quality is ignored in most models where only interference between pairs of connections or antennae is measured. Notable exceptions are [53] in which constraints are developed to determine the total interference from neighboring connections, and [44], where combinations of frequencies for more than two transmitters are forbidden. We will generally ignore multiple interference. So it becomes a binary relation: only two connections or antennae are involved. In mobile telephony and radio TV broadcasting, the receivers are spread within a ....
....exist, e.g. in case f is on the border of the spectrum, then the corresponding x variables should be removed. The constraints (45) are di#cult to handle in most optimization 16 methods. Therefore, some authors use other ways to take multiple interference into account. For instance, Dunkin et al. [44] introduce besides forbidden combinations for pairs, forbidden combinations of frequencies for triples of vertices. 3.6 Formulation Variants Alternative mathematical programming formulations have been proposed in the literature. These formulations are first and for all used to specify the ....
N. Dunkin, J. Bater, P. Jeavons, and D. Cohen, Towards high order constraint representations for the frequency assignment problem, Tech. Report CSD-TR-98--05, Royal Holloway University of London, 1998, Available at http://www.dcs.rhbnc.ac.uk/research/constraints/- publications/index.shtml.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC