Robust Capacity Assignment in Telecommunications
Abstract In telecommunications, the demand is a key data that drives network planning. The demand exhibits considerable variability, due to customers movement and introduction of new services and products in the present competitive markets. To deal with this uncertainty, we consider capacity assignm...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Ouorou, Adam [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2006 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© Springer 2006 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Computational Management Science - Springer-Verlag, 2004, 3(2006), 4 vom: 14. Juni, Seite 285-305 |
|---|---|
| Übergeordnetes Werk: |
volume:3 ; year:2006 ; number:4 ; day:14 ; month:06 ; pages:285-305 |
| Links: |
|---|
| DOI / URN: |
10.1007/s10287-006-0019-7 |
|---|
| Katalog-ID: |
OLC2075349312 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2075349312 | ||
| 003 | DE-627 | ||
| 005 | 20230502181942.0 | ||
| 007 | tu | ||
| 008 | 200820s2006 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s10287-006-0019-7 |2 doi | |
| 035 | |a (DE-627)OLC2075349312 | ||
| 035 | |a (DE-He213)s10287-006-0019-7-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 330 |a 510 |q VZ |
| 082 | 0 | 4 | |a 330 |q VZ |
| 084 | |a 3,2 |2 ssgn | ||
| 100 | 1 | |a Ouorou, Adam |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Robust Capacity Assignment in Telecommunications |
| 264 | 1 | |c 2006 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 500 | |a © Springer 2006 | ||
| 520 | |a Abstract In telecommunications, the demand is a key data that drives network planning. The demand exhibits considerable variability, due to customers movement and introduction of new services and products in the present competitive markets. To deal with this uncertainty, we consider capacity assignment problem in telecommunications in the framework of robust optimization proposed in Ben-Tal and Nemcrovski (Math Oper Res 23(4):769–805, 1998, MPS-SIAM series on optimization, 2001) and Kouvelis and Yu. We propose a decomposition scheme based on cutting plane methods. Some preliminary computational experiments indicate that the Elzinga–Moore cutting plane method (Elzinga and Moore in Math Program 8:134–145, 1975) can be a valuable choice. Since in some situations different possible uncertainty sets may exist, we propose a generalization of these models to cope at a time with a finite number of plausible uncertainty sets. A weight is associated with each uncertainty set to determine its relative importance or worth against another. | ||
| 650 | 4 | |a Robust optimization | |
| 650 | 4 | |a Capacity assignment in telecommunications | |
| 650 | 4 | |a Cutting plane methods | |
| 773 | 0 | 8 | |i Enthalten in |t Computational Management Science |d Springer-Verlag, 2004 |g 3(2006), 4 vom: 14. Juni, Seite 285-305 |w (DE-627)380021463 |w (DE-600)2136735-8 |w (DE-576)113850212 |x 1619-697X |7 nnns |
| 773 | 1 | 8 | |g volume:3 |g year:2006 |g number:4 |g day:14 |g month:06 |g pages:285-305 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s10287-006-0019-7 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-WIW | ||
| 912 | |a SSG-OPC-MAT | ||
| 912 | |a GBV_ILN_70 | ||
| 912 | |a GBV_ILN_267 | ||
| 912 | |a GBV_ILN_2018 | ||
| 912 | |a GBV_ILN_4277 | ||
| 912 | |a GBV_ILN_4316 | ||
| 951 | |a AR | ||
| 952 | |d 3 |j 2006 |e 4 |b 14 |c 06 |h 285-305 | ||
| author_variant |
a o ao |
|---|---|
| matchkey_str |
article:1619697X:2006----::outaaiysinetneeo |
| hierarchy_sort_str |
2006 |
| publishDate |
2006 |
| allfields |
10.1007/s10287-006-0019-7 doi (DE-627)OLC2075349312 (DE-He213)s10287-006-0019-7-p DE-627 ger DE-627 rakwb eng 330 510 VZ 330 VZ 3,2 ssgn Ouorou, Adam verfasserin aut Robust Capacity Assignment in Telecommunications 2006 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer 2006 Abstract In telecommunications, the demand is a key data that drives network planning. The demand exhibits considerable variability, due to customers movement and introduction of new services and products in the present competitive markets. To deal with this uncertainty, we consider capacity assignment problem in telecommunications in the framework of robust optimization proposed in Ben-Tal and Nemcrovski (Math Oper Res 23(4):769–805, 1998, MPS-SIAM series on optimization, 2001) and Kouvelis and Yu. We propose a decomposition scheme based on cutting plane methods. Some preliminary computational experiments indicate that the Elzinga–Moore cutting plane method (Elzinga and Moore in Math Program 8:134–145, 1975) can be a valuable choice. Since in some situations different possible uncertainty sets may exist, we propose a generalization of these models to cope at a time with a finite number of plausible uncertainty sets. A weight is associated with each uncertainty set to determine its relative importance or worth against another. Robust optimization Capacity assignment in telecommunications Cutting plane methods Enthalten in Computational Management Science Springer-Verlag, 2004 3(2006), 4 vom: 14. Juni, Seite 285-305 (DE-627)380021463 (DE-600)2136735-8 (DE-576)113850212 1619-697X nnns volume:3 year:2006 number:4 day:14 month:06 pages:285-305 https://doi.org/10.1007/s10287-006-0019-7 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OPC-MAT GBV_ILN_70 GBV_ILN_267 GBV_ILN_2018 GBV_ILN_4277 GBV_ILN_4316 AR 3 2006 4 14 06 285-305 |
| spelling |
10.1007/s10287-006-0019-7 doi (DE-627)OLC2075349312 (DE-He213)s10287-006-0019-7-p DE-627 ger DE-627 rakwb eng 330 510 VZ 330 VZ 3,2 ssgn Ouorou, Adam verfasserin aut Robust Capacity Assignment in Telecommunications 2006 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer 2006 Abstract In telecommunications, the demand is a key data that drives network planning. The demand exhibits considerable variability, due to customers movement and introduction of new services and products in the present competitive markets. To deal with this uncertainty, we consider capacity assignment problem in telecommunications in the framework of robust optimization proposed in Ben-Tal and Nemcrovski (Math Oper Res 23(4):769–805, 1998, MPS-SIAM series on optimization, 2001) and Kouvelis and Yu. We propose a decomposition scheme based on cutting plane methods. Some preliminary computational experiments indicate that the Elzinga–Moore cutting plane method (Elzinga and Moore in Math Program 8:134–145, 1975) can be a valuable choice. Since in some situations different possible uncertainty sets may exist, we propose a generalization of these models to cope at a time with a finite number of plausible uncertainty sets. A weight is associated with each uncertainty set to determine its relative importance or worth against another. Robust optimization Capacity assignment in telecommunications Cutting plane methods Enthalten in Computational Management Science Springer-Verlag, 2004 3(2006), 4 vom: 14. Juni, Seite 285-305 (DE-627)380021463 (DE-600)2136735-8 (DE-576)113850212 1619-697X nnns volume:3 year:2006 number:4 day:14 month:06 pages:285-305 https://doi.org/10.1007/s10287-006-0019-7 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OPC-MAT GBV_ILN_70 GBV_ILN_267 GBV_ILN_2018 GBV_ILN_4277 GBV_ILN_4316 AR 3 2006 4 14 06 285-305 |
| allfields_unstemmed |
10.1007/s10287-006-0019-7 doi (DE-627)OLC2075349312 (DE-He213)s10287-006-0019-7-p DE-627 ger DE-627 rakwb eng 330 510 VZ 330 VZ 3,2 ssgn Ouorou, Adam verfasserin aut Robust Capacity Assignment in Telecommunications 2006 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer 2006 Abstract In telecommunications, the demand is a key data that drives network planning. The demand exhibits considerable variability, due to customers movement and introduction of new services and products in the present competitive markets. To deal with this uncertainty, we consider capacity assignment problem in telecommunications in the framework of robust optimization proposed in Ben-Tal and Nemcrovski (Math Oper Res 23(4):769–805, 1998, MPS-SIAM series on optimization, 2001) and Kouvelis and Yu. We propose a decomposition scheme based on cutting plane methods. Some preliminary computational experiments indicate that the Elzinga–Moore cutting plane method (Elzinga and Moore in Math Program 8:134–145, 1975) can be a valuable choice. Since in some situations different possible uncertainty sets may exist, we propose a generalization of these models to cope at a time with a finite number of plausible uncertainty sets. A weight is associated with each uncertainty set to determine its relative importance or worth against another. Robust optimization Capacity assignment in telecommunications Cutting plane methods Enthalten in Computational Management Science Springer-Verlag, 2004 3(2006), 4 vom: 14. Juni, Seite 285-305 (DE-627)380021463 (DE-600)2136735-8 (DE-576)113850212 1619-697X nnns volume:3 year:2006 number:4 day:14 month:06 pages:285-305 https://doi.org/10.1007/s10287-006-0019-7 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OPC-MAT GBV_ILN_70 GBV_ILN_267 GBV_ILN_2018 GBV_ILN_4277 GBV_ILN_4316 AR 3 2006 4 14 06 285-305 |
| allfieldsGer |
10.1007/s10287-006-0019-7 doi (DE-627)OLC2075349312 (DE-He213)s10287-006-0019-7-p DE-627 ger DE-627 rakwb eng 330 510 VZ 330 VZ 3,2 ssgn Ouorou, Adam verfasserin aut Robust Capacity Assignment in Telecommunications 2006 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer 2006 Abstract In telecommunications, the demand is a key data that drives network planning. The demand exhibits considerable variability, due to customers movement and introduction of new services and products in the present competitive markets. To deal with this uncertainty, we consider capacity assignment problem in telecommunications in the framework of robust optimization proposed in Ben-Tal and Nemcrovski (Math Oper Res 23(4):769–805, 1998, MPS-SIAM series on optimization, 2001) and Kouvelis and Yu. We propose a decomposition scheme based on cutting plane methods. Some preliminary computational experiments indicate that the Elzinga–Moore cutting plane method (Elzinga and Moore in Math Program 8:134–145, 1975) can be a valuable choice. Since in some situations different possible uncertainty sets may exist, we propose a generalization of these models to cope at a time with a finite number of plausible uncertainty sets. A weight is associated with each uncertainty set to determine its relative importance or worth against another. Robust optimization Capacity assignment in telecommunications Cutting plane methods Enthalten in Computational Management Science Springer-Verlag, 2004 3(2006), 4 vom: 14. Juni, Seite 285-305 (DE-627)380021463 (DE-600)2136735-8 (DE-576)113850212 1619-697X nnns volume:3 year:2006 number:4 day:14 month:06 pages:285-305 https://doi.org/10.1007/s10287-006-0019-7 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OPC-MAT GBV_ILN_70 GBV_ILN_267 GBV_ILN_2018 GBV_ILN_4277 GBV_ILN_4316 AR 3 2006 4 14 06 285-305 |
| allfieldsSound |
10.1007/s10287-006-0019-7 doi (DE-627)OLC2075349312 (DE-He213)s10287-006-0019-7-p DE-627 ger DE-627 rakwb eng 330 510 VZ 330 VZ 3,2 ssgn Ouorou, Adam verfasserin aut Robust Capacity Assignment in Telecommunications 2006 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer 2006 Abstract In telecommunications, the demand is a key data that drives network planning. The demand exhibits considerable variability, due to customers movement and introduction of new services and products in the present competitive markets. To deal with this uncertainty, we consider capacity assignment problem in telecommunications in the framework of robust optimization proposed in Ben-Tal and Nemcrovski (Math Oper Res 23(4):769–805, 1998, MPS-SIAM series on optimization, 2001) and Kouvelis and Yu. We propose a decomposition scheme based on cutting plane methods. Some preliminary computational experiments indicate that the Elzinga–Moore cutting plane method (Elzinga and Moore in Math Program 8:134–145, 1975) can be a valuable choice. Since in some situations different possible uncertainty sets may exist, we propose a generalization of these models to cope at a time with a finite number of plausible uncertainty sets. A weight is associated with each uncertainty set to determine its relative importance or worth against another. Robust optimization Capacity assignment in telecommunications Cutting plane methods Enthalten in Computational Management Science Springer-Verlag, 2004 3(2006), 4 vom: 14. Juni, Seite 285-305 (DE-627)380021463 (DE-600)2136735-8 (DE-576)113850212 1619-697X nnns volume:3 year:2006 number:4 day:14 month:06 pages:285-305 https://doi.org/10.1007/s10287-006-0019-7 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OPC-MAT GBV_ILN_70 GBV_ILN_267 GBV_ILN_2018 GBV_ILN_4277 GBV_ILN_4316 AR 3 2006 4 14 06 285-305 |
| language |
English |
| source |
Enthalten in Computational Management Science 3(2006), 4 vom: 14. Juni, Seite 285-305 volume:3 year:2006 number:4 day:14 month:06 pages:285-305 |
| sourceStr |
Enthalten in Computational Management Science 3(2006), 4 vom: 14. Juni, Seite 285-305 volume:3 year:2006 number:4 day:14 month:06 pages:285-305 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Robust optimization Capacity assignment in telecommunications Cutting plane methods |
| dewey-raw |
330 |
| isfreeaccess_bool |
false |
| container_title |
Computational Management Science |
| authorswithroles_txt_mv |
Ouorou, Adam @@aut@@ |
| publishDateDaySort_date |
2006-06-14T00:00:00Z |
| hierarchy_top_id |
380021463 |
| dewey-sort |
3330 |
| id |
OLC2075349312 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2075349312</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230502181942.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200820s2006 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10287-006-0019-7</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2075349312</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10287-006-0019-7-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">330</subfield><subfield code="a">510</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">330</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">3,2</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Ouorou, Adam</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Robust Capacity Assignment in Telecommunications</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2006</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer 2006</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract In telecommunications, the demand is a key data that drives network planning. The demand exhibits considerable variability, due to customers movement and introduction of new services and products in the present competitive markets. To deal with this uncertainty, we consider capacity assignment problem in telecommunications in the framework of robust optimization proposed in Ben-Tal and Nemcrovski (Math Oper Res 23(4):769–805, 1998, MPS-SIAM series on optimization, 2001) and Kouvelis and Yu. We propose a decomposition scheme based on cutting plane methods. Some preliminary computational experiments indicate that the Elzinga–Moore cutting plane method (Elzinga and Moore in Math Program 8:134–145, 1975) can be a valuable choice. Since in some situations different possible uncertainty sets may exist, we propose a generalization of these models to cope at a time with a finite number of plausible uncertainty sets. A weight is associated with each uncertainty set to determine its relative importance or worth against another.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Robust optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Capacity assignment in telecommunications</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Cutting plane methods</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Computational Management Science</subfield><subfield code="d">Springer-Verlag, 2004</subfield><subfield code="g">3(2006), 4 vom: 14. Juni, Seite 285-305</subfield><subfield code="w">(DE-627)380021463</subfield><subfield code="w">(DE-600)2136735-8</subfield><subfield code="w">(DE-576)113850212</subfield><subfield code="x">1619-697X</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:3</subfield><subfield code="g">year:2006</subfield><subfield code="g">number:4</subfield><subfield code="g">day:14</subfield><subfield code="g">month:06</subfield><subfield code="g">pages:285-305</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10287-006-0019-7</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-WIW</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_267</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4277</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4316</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">3</subfield><subfield code="j">2006</subfield><subfield code="e">4</subfield><subfield code="b">14</subfield><subfield code="c">06</subfield><subfield code="h">285-305</subfield></datafield></record></collection>
|
| author |
Ouorou, Adam |
| spellingShingle |
Ouorou, Adam ddc 330 ssgn 3,2 misc Robust optimization misc Capacity assignment in telecommunications misc Cutting plane methods Robust Capacity Assignment in Telecommunications |
| authorStr |
Ouorou, Adam |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)380021463 |
| format |
Article |
| dewey-ones |
330 - Economics 510 - Mathematics |
| delete_txt_mv |
keep |
| author_role |
aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
1619-697X |
| topic_title |
330 510 VZ 330 VZ 3,2 ssgn Robust Capacity Assignment in Telecommunications Robust optimization Capacity assignment in telecommunications Cutting plane methods |
| topic |
ddc 330 ssgn 3,2 misc Robust optimization misc Capacity assignment in telecommunications misc Cutting plane methods |
| topic_unstemmed |
ddc 330 ssgn 3,2 misc Robust optimization misc Capacity assignment in telecommunications misc Cutting plane methods |
| topic_browse |
ddc 330 ssgn 3,2 misc Robust optimization misc Capacity assignment in telecommunications misc Cutting plane methods |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
Computational Management Science |
| hierarchy_parent_id |
380021463 |
| dewey-tens |
330 - Economics 510 - Mathematics |
| hierarchy_top_title |
Computational Management Science |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)380021463 (DE-600)2136735-8 (DE-576)113850212 |
| title |
Robust Capacity Assignment in Telecommunications |
| ctrlnum |
(DE-627)OLC2075349312 (DE-He213)s10287-006-0019-7-p |
| title_full |
Robust Capacity Assignment in Telecommunications |
| author_sort |
Ouorou, Adam |
| journal |
Computational Management Science |
| journalStr |
Computational Management Science |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
300 - Social sciences 500 - Science |
| recordtype |
marc |
| publishDateSort |
2006 |
| contenttype_str_mv |
txt |
| container_start_page |
285 |
| author_browse |
Ouorou, Adam |
| container_volume |
3 |
| class |
330 510 VZ 330 VZ 3,2 ssgn |
| format_se |
Aufsätze |
| author-letter |
Ouorou, Adam |
| doi_str_mv |
10.1007/s10287-006-0019-7 |
| dewey-full |
330 510 |
| title_sort |
robust capacity assignment in telecommunications |
| title_auth |
Robust Capacity Assignment in Telecommunications |
| abstract |
Abstract In telecommunications, the demand is a key data that drives network planning. The demand exhibits considerable variability, due to customers movement and introduction of new services and products in the present competitive markets. To deal with this uncertainty, we consider capacity assignment problem in telecommunications in the framework of robust optimization proposed in Ben-Tal and Nemcrovski (Math Oper Res 23(4):769–805, 1998, MPS-SIAM series on optimization, 2001) and Kouvelis and Yu. We propose a decomposition scheme based on cutting plane methods. Some preliminary computational experiments indicate that the Elzinga–Moore cutting plane method (Elzinga and Moore in Math Program 8:134–145, 1975) can be a valuable choice. Since in some situations different possible uncertainty sets may exist, we propose a generalization of these models to cope at a time with a finite number of plausible uncertainty sets. A weight is associated with each uncertainty set to determine its relative importance or worth against another. © Springer 2006 |
| abstractGer |
Abstract In telecommunications, the demand is a key data that drives network planning. The demand exhibits considerable variability, due to customers movement and introduction of new services and products in the present competitive markets. To deal with this uncertainty, we consider capacity assignment problem in telecommunications in the framework of robust optimization proposed in Ben-Tal and Nemcrovski (Math Oper Res 23(4):769–805, 1998, MPS-SIAM series on optimization, 2001) and Kouvelis and Yu. We propose a decomposition scheme based on cutting plane methods. Some preliminary computational experiments indicate that the Elzinga–Moore cutting plane method (Elzinga and Moore in Math Program 8:134–145, 1975) can be a valuable choice. Since in some situations different possible uncertainty sets may exist, we propose a generalization of these models to cope at a time with a finite number of plausible uncertainty sets. A weight is associated with each uncertainty set to determine its relative importance or worth against another. © Springer 2006 |
| abstract_unstemmed |
Abstract In telecommunications, the demand is a key data that drives network planning. The demand exhibits considerable variability, due to customers movement and introduction of new services and products in the present competitive markets. To deal with this uncertainty, we consider capacity assignment problem in telecommunications in the framework of robust optimization proposed in Ben-Tal and Nemcrovski (Math Oper Res 23(4):769–805, 1998, MPS-SIAM series on optimization, 2001) and Kouvelis and Yu. We propose a decomposition scheme based on cutting plane methods. Some preliminary computational experiments indicate that the Elzinga–Moore cutting plane method (Elzinga and Moore in Math Program 8:134–145, 1975) can be a valuable choice. Since in some situations different possible uncertainty sets may exist, we propose a generalization of these models to cope at a time with a finite number of plausible uncertainty sets. A weight is associated with each uncertainty set to determine its relative importance or worth against another. © Springer 2006 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OPC-MAT GBV_ILN_70 GBV_ILN_267 GBV_ILN_2018 GBV_ILN_4277 GBV_ILN_4316 |
| container_issue |
4 |
| title_short |
Robust Capacity Assignment in Telecommunications |
| url |
https://doi.org/10.1007/s10287-006-0019-7 |
| remote_bool |
false |
| ppnlink |
380021463 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s10287-006-0019-7 |
| up_date |
2024-07-04T01:04:51.138Z |
| _version_ |
1803608487247216640 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2075349312</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230502181942.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200820s2006 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10287-006-0019-7</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2075349312</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10287-006-0019-7-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">330</subfield><subfield code="a">510</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">330</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">3,2</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Ouorou, Adam</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Robust Capacity Assignment in Telecommunications</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2006</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer 2006</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract In telecommunications, the demand is a key data that drives network planning. The demand exhibits considerable variability, due to customers movement and introduction of new services and products in the present competitive markets. To deal with this uncertainty, we consider capacity assignment problem in telecommunications in the framework of robust optimization proposed in Ben-Tal and Nemcrovski (Math Oper Res 23(4):769–805, 1998, MPS-SIAM series on optimization, 2001) and Kouvelis and Yu. We propose a decomposition scheme based on cutting plane methods. Some preliminary computational experiments indicate that the Elzinga–Moore cutting plane method (Elzinga and Moore in Math Program 8:134–145, 1975) can be a valuable choice. Since in some situations different possible uncertainty sets may exist, we propose a generalization of these models to cope at a time with a finite number of plausible uncertainty sets. A weight is associated with each uncertainty set to determine its relative importance or worth against another.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Robust optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Capacity assignment in telecommunications</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Cutting plane methods</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Computational Management Science</subfield><subfield code="d">Springer-Verlag, 2004</subfield><subfield code="g">3(2006), 4 vom: 14. Juni, Seite 285-305</subfield><subfield code="w">(DE-627)380021463</subfield><subfield code="w">(DE-600)2136735-8</subfield><subfield code="w">(DE-576)113850212</subfield><subfield code="x">1619-697X</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:3</subfield><subfield code="g">year:2006</subfield><subfield code="g">number:4</subfield><subfield code="g">day:14</subfield><subfield code="g">month:06</subfield><subfield code="g">pages:285-305</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10287-006-0019-7</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-WIW</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_267</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4277</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4316</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">3</subfield><subfield code="j">2006</subfield><subfield code="e">4</subfield><subfield code="b">14</subfield><subfield code="c">06</subfield><subfield code="h">285-305</subfield></datafield></record></collection>
|
| score |
7.401101 |