Provably Good Solutions for Wavelength Assignment in Optical Networks
Please always quote using this URN: urn:nbn:de:0297-zib-8155
- 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 formula tion by generalizing the formulation of Mehrotra and Trick (1996) 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.
Author: | Arie M.C.A. Koster, Adrian Zymolka |
---|---|
Document Type: | ZIB-Report |
Tag: | column generation; integer programming; wavelength assignment |
MSC-Classification: | 90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Bxx Operations research and management science / 90B18 Communication networks [See also 68M10, 94A05] |
90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Cxx Mathematical programming [See also 49Mxx, 65Kxx] / 90C10 Integer programming | |
90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Cxx Mathematical programming [See also 49Mxx, 65Kxx] / 90C90 Applications of mathematical programming | |
Date of first Publication: | 2004/10/26 |
Series (Serial Number): | ZIB-Report (04-40) |
ZIB-Reportnumber: | 04-40 |
Published in: | Appeared in: Proceeding of ONDM 2005, the 9th IFIP Working Conference on Optical Network Design and Modelling, February 7-9, 2005, Milan, Italy, pp. 335-345 |