Fixed spectrum frequency assignment di montemanni roberto (6 risultati)

Condizione: New.

Taschenbuch. Condizione: Neu. The fixed spectrum frequency assignment problem | Upper and lower bounds | Roberto Montemanni | Taschenbuch | 196 S. | Englisch | 2010 | LAP LAMBERT Academic Publishing | EAN 9783838333083 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu. …

Paperback. Condizione: Brand New. 196 pages. 8.66x5.91x0.45 inches. In Stock.

Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The frequency assignment problem involves the assignment of discrete channels (frequencies) to the transmitters of a radio network. A separation between the frequencies assigned to transmitters close to each other is required to avoid interference. Unnecessary separation causes an excess requirement for spectrum, which is a valuable resource. Consequently good assignments minimise both interference and the spectrum required. The fixed spectrum frequency assignment problem, where the spectrum available is given and the target is to minimise the total interference of the system, is considered. Interference is modelled through binary constraints, and the problem is represented by an undirected weighted graph. Some integer programming formulations are discussed, together with the adaptation of two metaheuristics. Novel lower bounding techniques, which work by combining lower bounds calculated for some subproblems, are presented. The most effective method is based on a linear program which is reinforced with inequalities derived from the lower bounds calculated on clique-like subproblems. Detailed computational results, obtained on a wide range of benchmarks, are finally reported. 196 pp. Englisch.…

Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -The frequency assignment problem involves the assignment of discrete channels (frequencies) to the transmitters of a radio network. A separation between the frequencies assigned to transmitters close to each other is required to avoid interference. Unnecessary separation causes an excess requirement for spectrum, which is a valuable resource. Consequently good assignments minimise both interference and the spectrum required. The fixed spectrum frequency assignment problem, where the spectrum available is given and the target is to minimise the total interference of the system, is considered. Interference is modelled through binary constraints, and the problem is represented by an undirected weighted graph. Some integer programming formulations are discussed, together with the adaptation of two metaheuristics. Novel lower bounding techniques, which work by combining lower bounds calculated for some subproblems, are presented. The most effective method is based on a linear program which is reinforced with inequalities derived from the lower bounds calculated on clique-like subproblems. Detailed computational results, obtained on a wide range of benchmarks, are finally reported.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 196 pp. Englisch.…

Taschenbuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - The frequency assignment problem involves the assignment of discrete channels (frequencies) to the transmitters of a radio network. A separation between the frequencies assigned to transmitters close to each other is required to avoid interference. Unnecessary separation causes an excess requirement for spectrum, which is a valuable resource. Consequently good assignments minimise both interference and the spectrum required. The fixed spectrum frequency assignment problem, where the spectrum available is given and the target is to minimise the total interference of the system, is considered. Interference is modelled through binary constraints, and the problem is represented by an undirected weighted graph. Some integer programming formulations are discussed, together with the adaptation of two metaheuristics. Novel lower bounding techniques, which work by combining lower bounds calculated for some subproblems, are presented. The most effective method is based on a linear program which is reinforced with inequalities derived from the lower bounds calculated on clique-like subproblems. Detailed computational results, obtained on a wide range of benchmarks, are finally reported.…