Provably good solutions for wavelength assignment in optical networks:

Abstract: "In this paper, we study the minimum converter wavelength assignment problem in optical networks. To benchmark the quality of solutions obtained by heuristics, we derive an integer programming formulation by generalizing the formulation of Mehrotra and Trick [12] for the vertex colori...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Koster, Arie M. C. A. (VerfasserIn), Zymolka, Adrian (VerfasserIn)
Format: Buch
Sprache:English
Veröffentlicht: Berlin Konrad-Zuse-Zentrum für Informationstechnik 2004
Schriftenreihe:ZIB-Report 2004,40
Schlagworte:
Zusammenfassung:Abstract: "In this paper, we study the minimum converter wavelength assignment problem in optical networks. To benchmark the quality of solutions obtained by heuristics, we derive an integer programming formulation by generalizing the formulation of Mehrotra and Trick [12] for the vertex coloring problem. To handle the exponential number of variables, we propose a column generation approach. Computational experiments show that the value of the linear relaxation states a good lower bound and can often prove optimality of the best solution generated heuristically."
Beschreibung:19 S. graph. Darst., Kt.