Improving a Set of Sequential Heuristics for the Channel Allocation Problem

Rouskas, A; Anagnostou, M

dc.contributor.author	Rouskas, A	en
dc.contributor.author	Anagnostou, M	en
dc.date.accessioned	2014-03-01T01:49:26Z
dc.date.available	2014-03-01T01:49:26Z
dc.date.issued	2000	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/25780
dc.subject	Benchmark Problem	en
dc.subject	Cellular Network	en
dc.subject	Cellular System	en
dc.subject	Channel Allocation	en
dc.subject	Graph Coloring	en
dc.subject	Optimal Solution	en
dc.title	Improving a Set of Sequential Heuristics for the Channel Allocation Problem	en
heal.type	journalArticle	en
heal.identifier.primary	10.1023/A:1009583520060	en
heal.identifier.secondary	http://dx.doi.org/10.1023/A:1009583520060	en
heal.publicationDate	2000	en
heal.abstract	We consider the minimum span channel allocation problem encountered in cellular systems. Our solution approach is based on a set of sequential heuristics, and incorporates concepts borrowed from graph coloring schemes. The performance of the new heuristics has been tested on known benchmark problems, whose optimal solutions have been recently quoted in the literature. The new heuristics are quite effective	en
heal.journalName	International Journal of Wireless Information Networks	en
dc.identifier.doi	10.1023/A:1009583520060	en