A survey of the results described in the author's PhD thesis (Montemanni 2001) is presented. The thesis, which was supervised by Prof. Derek H. Smith and Dr. Stuart M. Allen, has been defended in January 2002 at the University of Glamorgan (U.K.). The thesis proposes new heuristic algorithms, based on well-known meta-heuristic paradigms, and new lower bounding techniques, based on linear programming, for the fixed spectrum frequency assignment problem. © 2003 Springer-Verlag Berlin/Heidelberg.
Upper and lower bounds for the fixed spectrum frequency assignment problem / Montemanni, R.. - In: 4OR. - ISSN 1619-4500. - 1:3(2003), pp. 257-260. [10.1007/s10288-003-0018-2]
Upper and lower bounds for the fixed spectrum frequency assignment problem
Montemanni R.
2003
Abstract
A survey of the results described in the author's PhD thesis (Montemanni 2001) is presented. The thesis, which was supervised by Prof. Derek H. Smith and Dr. Stuart M. Allen, has been defended in January 2002 at the University of Glamorgan (U.K.). The thesis proposes new heuristic algorithms, based on well-known meta-heuristic paradigms, and new lower bounding techniques, based on linear programming, for the fixed spectrum frequency assignment problem. © 2003 Springer-Verlag Berlin/Heidelberg.
Pubblicazioni consigliate
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris
