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...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Berlin
Konrad-Zuse-Zentrum für Informationstechnik
2004
|
| Series: | ZIB-Report
2004,40 |
| Subjects: | |
| Summary: | 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." |
| Physical Description: | 19 S. graph. Darst., Kt. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV019643118 | ||
| 003 | DE-604 | ||
| 005 | 20060111 | ||
| 007 | t| | ||
| 008 | 041223s2004 xx bd|| |||| 00||| eng d | ||
| 035 | |a (OCoLC)60248900 | ||
| 035 | |a (DE-599)BVBBV019643118 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-703 | ||
| 100 | 1 | |a Koster, Arie M. C. A. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Provably good solutions for wavelength assignment in optical networks |c Arie M. C. A. Koster ; Adrian Zymolka |
| 264 | 1 | |a Berlin |b Konrad-Zuse-Zentrum für Informationstechnik |c 2004 | |
| 300 | |a 19 S. |b graph. Darst., Kt. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a ZIB-Report |v 2004,40 | |
| 520 | 3 | |a 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." | |
| 650 | 4 | |a Integer programming | |
| 650 | 4 | |a Optical data processing | |
| 650 | 4 | |a Wavelength division multiplexing | |
| 700 | 1 | |a Zymolka, Adrian |e Verfasser |0 (DE-588)122889908 |4 aut | |
| 830 | 0 | |a ZIB-Report |v 2004,40 |w (DE-604)BV013191727 |9 2004,40 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-012971950 | |
Record in the Search Index
| _version_ | 1820882437380505600 |
|---|---|
| adam_text | |
| any_adam_object | |
| author | Koster, Arie M. C. A. Zymolka, Adrian |
| author_GND | (DE-588)122889908 |
| author_facet | Koster, Arie M. C. A. Zymolka, Adrian |
| author_role | aut aut |
| author_sort | Koster, Arie M. C. A. |
| author_variant | a m c a k amca amcak a z az |
| building | Verbundindex |
| bvnumber | BV019643118 |
| classification_rvk | SS 4779 |
| ctrlnum | (OCoLC)60248900 (DE-599)BVBBV019643118 |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV019643118</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20060111</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">041223s2004 xx bd|| |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)60248900</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV019643118</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-703</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Koster, Arie M. C. A.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Provably good solutions for wavelength assignment in optical networks</subfield><subfield code="c">Arie M. C. A. Koster ; Adrian Zymolka</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin</subfield><subfield code="b">Konrad-Zuse-Zentrum für Informationstechnik</subfield><subfield code="c">2004</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">19 S.</subfield><subfield code="b">graph. Darst., Kt.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">ZIB-Report</subfield><subfield code="v">2004,40</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">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."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Integer programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Optical data processing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Wavelength division multiplexing</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zymolka, Adrian</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)122889908</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">ZIB-Report</subfield><subfield code="v">2004,40</subfield><subfield code="w">(DE-604)BV013191727</subfield><subfield code="9">2004,40</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-012971950</subfield></datafield></record></collection> |
| id | DE-604.BV019643118 |
| illustrated | Illustrated |
| indexdate | 2025-01-10T17:06:53Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-012971950 |
| oclc_num | 60248900 |
| open_access_boolean | |
| owner | DE-703 |
| owner_facet | DE-703 |
| physical | 19 S. graph. Darst., Kt. |
| publishDate | 2004 |
| publishDateSearch | 2004 |
| publishDateSort | 2004 |
| publisher | Konrad-Zuse-Zentrum für Informationstechnik |
| record_format | marc |
| series | ZIB-Report |
| series2 | ZIB-Report |
| spelling | Koster, Arie M. C. A. Verfasser aut Provably good solutions for wavelength assignment in optical networks Arie M. C. A. Koster ; Adrian Zymolka Berlin Konrad-Zuse-Zentrum für Informationstechnik 2004 19 S. graph. Darst., Kt. txt rdacontent n rdamedia nc rdacarrier ZIB-Report 2004,40 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." Integer programming Optical data processing Wavelength division multiplexing Zymolka, Adrian Verfasser (DE-588)122889908 aut ZIB-Report 2004,40 (DE-604)BV013191727 2004,40 |
| spellingShingle | Koster, Arie M. C. A. Zymolka, Adrian Provably good solutions for wavelength assignment in optical networks ZIB-Report Integer programming Optical data processing Wavelength division multiplexing |
| title | Provably good solutions for wavelength assignment in optical networks |
| title_auth | Provably good solutions for wavelength assignment in optical networks |
| title_exact_search | Provably good solutions for wavelength assignment in optical networks |
| title_full | Provably good solutions for wavelength assignment in optical networks Arie M. C. A. Koster ; Adrian Zymolka |
| title_fullStr | Provably good solutions for wavelength assignment in optical networks Arie M. C. A. Koster ; Adrian Zymolka |
| title_full_unstemmed | Provably good solutions for wavelength assignment in optical networks Arie M. C. A. Koster ; Adrian Zymolka |
| title_short | Provably good solutions for wavelength assignment in optical networks |
| title_sort | provably good solutions for wavelength assignment in optical networks |
| topic | Integer programming Optical data processing Wavelength division multiplexing |
| topic_facet | Integer programming Optical data processing Wavelength division multiplexing |
| volume_link | (DE-604)BV013191727 |
| work_keys_str_mv | AT kosterariemca provablygoodsolutionsforwavelengthassignmentinopticalnetworks AT zymolkaadrian provablygoodsolutionsforwavelengthassignmentinopticalnetworks |