GRAPH - Generating Radio link frequency Assignment Problems Heuristically (1995)
| Citations: | 11 - 0 self |
BibTeX
@MISC{Benthem95graph-,
author = {Henk P. Van Benthem and Dr. Ir. C. Roos and Dr. T. Terlaky and Dr. A. L. Hipolito and Drs B. Jansen},
title = {GRAPH - Generating Radio link frequency Assignment Problems Heuristically},
year = {1995}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
The Radio Link Frequency Assignment Problem (RLFAP) is an NP-complete combinatorial optimization problem, defined as follows: find an optimal assignment of frequencies to transmitting radio links so that various constraints are (maximal) satisfied and a minimal amount of electromagnetic spectrum is wasted. The constraints include different priorities of users, technical necessities and the conditions which place acceptable upper bounds upon the unwanted interference. The three ministries of defense of France, Great Britain and the Netherlands came up with a project at the end of 1993, to join the forces of different European mathematical institutes in applying various and new mathematical techniques to solve the RLFAP. The Operations Research department of TWI at the TU Delft joint this project in Januari 1994 and started investigating these Assignment Problems. The RLFAP test-case generator GRAPH (Generating Radio link frequency Assignment Problems Heuristically) is a computer program...
Keyphrases
minimal amount electromagnetic spectrum different european mathematical institute unwanted interference acceptable upper bound optimal assignment radio link frequency assignment problem operation research department new mathematical technique great britain tu delft joint np-complete combinatorial optimization problem computer program various constraint different priority assignment problem radio link rlfap test-case generator graph technical necessity
