The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Channel assignment for cellular radio using simulated annealing
Abstract
The channel assignment problem, i.e. the task of assigning the channels to the radio base stations in a spectrum-efficient way, is an NP-complete optimization problem occurring during design of cellular radio systems. Previously, this problem has been solved by graph coloring algorithms. An alternative approach is presented. The problem is solved using simulated annealing, which is a general approach to combinatorial optimization. The algorithm has been successfully applied to practical radio network planning situations. One major benefit of the approach consists in the enhanced flexibility it gives to the engineer.>
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
Equation of State Calculations by Fast Computing Machines
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953) · The Journal of Chemical Physics · doi:10.1063/1.1699114 · Cited by 37,192
Stochastic relaxation, gibbs distributions, and the bayesian restoration of images.
Geman, S., & Geman, D. (1984) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1984.4767596 · Cited by 17,949
“Neural” computation of decisions in optimization problems
Hopfield, J. J., & Tank, D. W. (1985) · Biological Cybernetics · doi:10.1007/bf00339943 · Cited by 6,031
An Efficient Heuristic Procedure for Partitioning Graphs
Kernighan, B. W., & Lin, S. (1970) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1970.tb01770.x · Cited by 5,305
Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm
Černý, V. (1985) · Journal of Optimization Theory and Applications · doi:10.1007/bf00940812 · Cited by 3,436
*13 Simulated Annealing and Boltzmann Machines
(1993) · Neural Network Learning and Expert Systems · doi:10.7551/mitpress/4931.003.0017 · Cited by 1,637
Frequency assignment: Theory and applications
Hale, W. K. (1980) · Proceedings of the IEEE · doi:10.1109/proc.1980.11899 · Cited by 1,344
Szu, H., & Hartley, R. (1987) · Physics Letters A · doi:10.1016/0375-9601(87)90796-1 · Cited by 1,089
Johnson, D. S., Aragon, C. R., McGeoch, L. A., & Schevon, C. (1991) · Operations Research · doi:10.1287/opre.39.3.378 · Cited by 845
Cited by
Metaheuristics: A bibliography
Osman, I. H., & Laporte, G. (1996) · Annals of Operations Research · doi:10.1007/bf02125421 · Cited by 672
Chemical-Reaction-Inspired Metaheuristic for Optimization
Lam, A. Y. S., & Li, V. O. K. (2010) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2009.2033580 · Cited by 587
Models and solution techniques for frequency assignment problems
Aardal, K. I., van Hoesel, S. P. M., Koster, A. M. C. A., Mannino, C., & Sassano, A. (2007) · Annals of Operations Research · doi:10.1007/s10479-007-0178-0 · Cited by 339
Metadata
- Authors
- Duque-Anton, M., Kunz, D., & Ruber, B.
- Venue
- IEEE Transactions on Vehicular Technology
- Published
- 1993
- Volume
- 42
- Issue
- 1
- Pages
- 14-21
- ISSN
- 0018-9545 (ISSN-L)
- OpenAlex
- W2142906016
- Cited by
- 294
- References
- 12
- FWCI
- 7.97
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Channel assignment for cellular radio using simulated annealing. https://app.cochat.ai/papers/10.1109/25.192382
- The paper
- Duque-Anton, M., Kunz, D., & Ruber, B. (1993). Channel assignment for cellular radio using simulated annealing. IEEE Transactions on Vehicular Technology. https://doi.org/10.1109/25.192382
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.