32,99 €
inkl. MwSt.
Versandkostenfrei*
Versandfertig in 6-10 Tagen
  • Broschiertes Buch

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.

Produktbeschreibung
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.
Autorenporträt
Roberto Montemanni. Laurea degree in Computer Science from the Università di Bologna, Italy (1999); PhD in Applied Mathematics from the University of Glamorgan, United Kingdom (2002). Senior Researcher at Istituto Dalle Molle di Studi sull¿Intelligenza Artificiale (IDSIA), Lugano, Switzerland. Lecturer at SUPSI and USI, Lugano, Switzerland.