montemanni roberto (17 Ergebnisse)

Zustand: New.

Zustand: New.

Taschenbuch. Zustand: Neu. The Min-Interference Frequency Assignment Problem | An Exact Algorithm | Roberto Montemanni | Taschenbuch | 68 S. | Englisch | 2011 | LAP LAMBERT Academic Publishing | EAN 9783845470757 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu.

Taschenbuch. Zustand: 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. Zustand: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Paperback. Zustand: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

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

Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The frequency assignment problem involves the assignment of discrete channels to the transmitters of a radio network. Frequency separation is necessary to avoid interference by other transmitters to the signal received from the wanted transmitter at the reception points. Unnecessary separation causes an excess requirement for spectrum. Good assignments minimise interference and the spectrum required. Some different variations of the problem are reviewed in this book. We mainly consider the 'Fixed Spectrum Problem', where there is a fixed available spectrum of frequencies and the aim is to minimise interference. For this problem we analise the 'Binary Constraints Model', where only interference from a single transmitter at a time is considered, and the more realistic 'Multiple Interference Model', where interferences from more than one transmitter are considered at the same moment. In particular, we analyse some Integer Programming formulation for the binary constraints model to understand whether they can be suitable for developing lower bounds. Some new algorithms for the multiple interference model are finally discussed. 96 pp. Englisch.

Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -In this book we consider the Frequency Assignment Problem, where the objective is to minimize the cost due to interference arising in a solution. We use a quadratic 0-1 integer programming formulation of the problem as a basis to derive new lower bounds and problem reduction rules. A tree search algorithm that uses the lower bounds and dominance criteria is also presented. Computational results are shown on standard benchmark instances from the literature. 68 pp. Englisch.

Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. The frequency assignment problem involves the assignment of discrete channels to the transmitters of a radio network. Frequency separation is necessary to avoid interference by other transmitters to the signal received from the wanted transmitter at the rec.

Taschenbuch. Zustand: 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. Zustand: Neu. This item is printed on demand - Print on Demand Titel. Neuware -The frequency assignment problem involves the assignment of discrete channels to the transmitters of a radio network. Frequency separation is necessary to avoid interference by other transmitters to the signal received from the wanted transmitter at the reception points. Unnecessary separation causes an excess requirement for spectrum. Good assignments minimise interference and the spectrum required. Some different variations of the problem are reviewed in this book. We mainly consider the 'Fixed Spectrum Problem', where there is a fixed available spectrum of frequencies and the aim is to minimise interference. For this problem we analise the 'Binary Constraints Model', where only interference from a single transmitter at a time is considered, and the more realistic 'Multiple Interference Model', where interferences from more than one transmitter are considered at the same moment. In particular, we analyse some Integer Programming formulation for the binary constraints model to understand whether they can be suitable for developing lower bounds. Some new algorithms for the multiple interference model are finally discussed.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 96 pp. Englisch.

Taschenbuch. Zustand: Neu. This item is printed on demand - Print on Demand Titel. Neuware -In this book we consider the Frequency Assignment Problem, where the objective is to minimize the cost due to interference arising in a solution. We use a quadratic 0-1 integer programming formulation of the problem as a basis to derive new lower bounds and problem reduction rules. A tree search algorithm that uses the lower bounds and dominance criteria is also presented. Computational results are shown on standard benchmark instances from the literature.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 68 pp. Englisch.

Taschenbuch. Zustand: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - The frequency assignment problem involves the assignment of discrete channels to the transmitters of a radio network. Frequency separation is necessary to avoid interference by other transmitters to the signal received from the wanted transmitter at the reception points. Unnecessary separation causes an excess requirement for spectrum. Good assignments minimise interference and the spectrum required. Some different variations of the problem are reviewed in this book. We mainly consider the 'Fixed Spectrum Problem', where there is a fixed available spectrum of frequencies and the aim is to minimise interference. For this problem we analise the 'Binary Constraints Model', where only interference from a single transmitter at a time is considered, and the more realistic 'Multiple Interference Model', where interferences from more than one transmitter are considered at the same moment. In particular, we analyse some Integer Programming formulation for the binary constraints model to understand whether they can be suitable for developing lower bounds. Some new algorithms for the multiple interference model are finally discussed.

Taschenbuch. Zustand: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - In this book we consider the Frequency Assignment Problem, where the objective is to minimize the cost due to interference arising in a solution. We use a quadratic 0-1 integer programming formulation of the problem as a basis to derive new lower bounds and problem reduction rules. A tree search algorithm that uses the lower bounds and dominance criteria is also presented. Computational results are shown on standard benchmark instances from the literature.

Taschenbuch. Zustand: 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.

Taschenbuch. Zustand: 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.