Robust network design in telecommunications under polytope demand uncertainty
We consider a model for robust network design in telecommunications, in which we minimize the cost of the maximum mismatch between supply and demand. In the present study, the demand is uncertain and takes its values in a polytope defined by constraints. This problem is hardly tractable, so we limit...
Gespeichert in:
| Veröffentlicht in: | European journal of operational research 2010-11, Vol.206 (3), p.634-641 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 641 |
|---|---|
| container_issue | 3 |
| container_start_page | 634 |
| container_title | European journal of operational research |
| container_volume | 206 |
| creator | Lemaréchal, Claude Ouorou, Adam Petrou, Georgios |
| description | We consider a model for robust network design in telecommunications, in which we minimize the cost of the maximum mismatch between supply and demand. In the present study, the demand is uncertain and takes its values in a polytope defined by constraints. This problem is hardly tractable, so we limit ourselves to computing lower bounds (by a column-generation mechanism) and upper bounds (using an algorithm due to Falk and Soland for maximizing a separable convex function over a polytope). The experimental gap obtained turns out to be large, and this seems to be mainly due to poor upper bounds. Two possible solutions are suggested for further research aimed at improving them: dc optimization (to minimize the difference of two convex functions) and AARC modeling (affinely adjustable robust counterpart). |
| doi_str_mv | 10.1016/j.ejor.2010.03.007 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_753751544</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0377221710001803</els_id><sourcerecordid>2021439351</sourcerecordid><originalsourceid>FETCH-LOGICAL-c488t-4bd4383e985902e5207d6f7f6f19fecb0c128765946f4fd5a8976887f6d59a463</originalsourceid><addsrcrecordid>eNp9kUuLFDEUhQtRsB39A64KQVxVm1clKXAjg49hRgTRdUinbjRlVVImqZH-9962h1m4MHCTEL5zuPekaZ5TsqeEytfTHqaU94zgA-F7QtSDZke1Yp3UkjxsdoQr1TFG1ePmSSkTIYT2tN81n76kw1ZqG6H-TvlnO0IJ32MbYlthBpeWZYvB2RpSLO0WR8jtmuZjTSsgu9g44quDXG2I9fi0eeTtXODZ3XnRfHv_7uvlx-7m84ery7c3nRNa104cRsE1h0H3A2HQM6JG6ZWXng4e3IE4yrSS_SCkF37srR6U1BqBsR-skPyieXX2XXP6tUGpZgnFwTzbCGkrRvVc4XhCIPniH3JKW47YnGFEUKF7erJjZ8jlVEoGb9YcFpuPhhJzytdM5pSvOeVrCDeYL4quz6IMK7h7BeBCFIq5NdwyInE__r2hlNuAxbFWLMmFkYKaH3VBt5d3fdri7OyzjS6Ue1fGcJ5BMOTenDnAeG8DZFNcAPyBMWRw1Ywp_K_pP2Sxqg0</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>204148516</pqid></control><display><type>article</type><title>Robust network design in telecommunications under polytope demand uncertainty</title><source>RePEc</source><source>Elsevier ScienceDirect Journals</source><creator>Lemaréchal, Claude ; Ouorou, Adam ; Petrou, Georgios</creator><creatorcontrib>Lemaréchal, Claude ; Ouorou, Adam ; Petrou, Georgios</creatorcontrib><description>We consider a model for robust network design in telecommunications, in which we minimize the cost of the maximum mismatch between supply and demand. In the present study, the demand is uncertain and takes its values in a polytope defined by constraints. This problem is hardly tractable, so we limit ourselves to computing lower bounds (by a column-generation mechanism) and upper bounds (using an algorithm due to Falk and Soland for maximizing a separable convex function over a polytope). The experimental gap obtained turns out to be large, and this seems to be mainly due to poor upper bounds. Two possible solutions are suggested for further research aimed at improving them: dc optimization (to minimize the difference of two convex functions) and AARC modeling (affinely adjustable robust counterpart).</description><identifier>ISSN: 0377-2217</identifier><identifier>EISSN: 1872-6860</identifier><identifier>DOI: 10.1016/j.ejor.2010.03.007</identifier><identifier>CODEN: EJORDT</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>65K05 ; 65K05 90C25 90C27 Telecommunication network design Polyhedral uncertainty Robust optimization Min-max-min problems ; 90C25 ; 90C27 ; Applied sciences ; Communications networks ; Computer science; control theory; systems ; Computer systems and distributed systems. User interface ; Cost reduction ; Demand ; Exact sciences and technology ; Flows in networks. Combinatorial problems ; Inventory control, production control. Distribution ; Marketing ; Mathematical analysis ; Mathematical models ; Min–max–min problems ; Networks ; Operational research and scientific management ; Operational research. Management science ; Optimization algorithms ; Polyhedral uncertainty ; Polytopes ; Robust optimization ; Software ; Studies ; Telecommunication network design ; Telecommunications ; Uncertainty ; Upper bounds</subject><ispartof>European journal of operational research, 2010-11, Vol.206 (3), p.634-641</ispartof><rights>2010 Elsevier B.V.</rights><rights>2015 INIST-CNRS</rights><rights>Copyright Elsevier Sequoia S.A. Nov 1, 2010</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c488t-4bd4383e985902e5207d6f7f6f19fecb0c128765946f4fd5a8976887f6d59a463</citedby><cites>FETCH-LOGICAL-c488t-4bd4383e985902e5207d6f7f6f19fecb0c128765946f4fd5a8976887f6d59a463</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/j.ejor.2010.03.007$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,777,781,3537,3994,27905,27906,45976</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=22751942$$DView record in Pascal Francis$$Hfree_for_read</backlink><backlink>$$Uhttp://econpapers.repec.org/article/eeeejores/v_3a206_3ay_3a2010_3ai_3a3_3ap_3a634-641.htm$$DView record in RePEc$$Hfree_for_read</backlink></links><search><creatorcontrib>Lemaréchal, Claude</creatorcontrib><creatorcontrib>Ouorou, Adam</creatorcontrib><creatorcontrib>Petrou, Georgios</creatorcontrib><title>Robust network design in telecommunications under polytope demand uncertainty</title><title>European journal of operational research</title><description>We consider a model for robust network design in telecommunications, in which we minimize the cost of the maximum mismatch between supply and demand. In the present study, the demand is uncertain and takes its values in a polytope defined by constraints. This problem is hardly tractable, so we limit ourselves to computing lower bounds (by a column-generation mechanism) and upper bounds (using an algorithm due to Falk and Soland for maximizing a separable convex function over a polytope). The experimental gap obtained turns out to be large, and this seems to be mainly due to poor upper bounds. Two possible solutions are suggested for further research aimed at improving them: dc optimization (to minimize the difference of two convex functions) and AARC modeling (affinely adjustable robust counterpart).</description><subject>65K05</subject><subject>65K05 90C25 90C27 Telecommunication network design Polyhedral uncertainty Robust optimization Min-max-min problems</subject><subject>90C25</subject><subject>90C27</subject><subject>Applied sciences</subject><subject>Communications networks</subject><subject>Computer science; control theory; systems</subject><subject>Computer systems and distributed systems. User interface</subject><subject>Cost reduction</subject><subject>Demand</subject><subject>Exact sciences and technology</subject><subject>Flows in networks. Combinatorial problems</subject><subject>Inventory control, production control. Distribution</subject><subject>Marketing</subject><subject>Mathematical analysis</subject><subject>Mathematical models</subject><subject>Min–max–min problems</subject><subject>Networks</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>Optimization algorithms</subject><subject>Polyhedral uncertainty</subject><subject>Polytopes</subject><subject>Robust optimization</subject><subject>Software</subject><subject>Studies</subject><subject>Telecommunication network design</subject><subject>Telecommunications</subject><subject>Uncertainty</subject><subject>Upper bounds</subject><issn>0377-2217</issn><issn>1872-6860</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2010</creationdate><recordtype>article</recordtype><sourceid>X2L</sourceid><recordid>eNp9kUuLFDEUhQtRsB39A64KQVxVm1clKXAjg49hRgTRdUinbjRlVVImqZH-9962h1m4MHCTEL5zuPekaZ5TsqeEytfTHqaU94zgA-F7QtSDZke1Yp3UkjxsdoQr1TFG1ePmSSkTIYT2tN81n76kw1ZqG6H-TvlnO0IJ32MbYlthBpeWZYvB2RpSLO0WR8jtmuZjTSsgu9g44quDXG2I9fi0eeTtXODZ3XnRfHv_7uvlx-7m84ery7c3nRNa104cRsE1h0H3A2HQM6JG6ZWXng4e3IE4yrSS_SCkF37srR6U1BqBsR-skPyieXX2XXP6tUGpZgnFwTzbCGkrRvVc4XhCIPniH3JKW47YnGFEUKF7erJjZ8jlVEoGb9YcFpuPhhJzytdM5pSvOeVrCDeYL4quz6IMK7h7BeBCFIq5NdwyInE__r2hlNuAxbFWLMmFkYKaH3VBt5d3fdri7OyzjS6Ue1fGcJ5BMOTenDnAeG8DZFNcAPyBMWRw1Ywp_K_pP2Sxqg0</recordid><startdate>20101101</startdate><enddate>20101101</enddate><creator>Lemaréchal, Claude</creator><creator>Ouorou, Adam</creator><creator>Petrou, Georgios</creator><general>Elsevier B.V</general><general>Elsevier</general><general>Elsevier Sequoia S.A</general><scope>IQODW</scope><scope>DKI</scope><scope>X2L</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>7TA</scope><scope>JG9</scope></search><sort><creationdate>20101101</creationdate><title>Robust network design in telecommunications under polytope demand uncertainty</title><author>Lemaréchal, Claude ; Ouorou, Adam ; Petrou, Georgios</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c488t-4bd4383e985902e5207d6f7f6f19fecb0c128765946f4fd5a8976887f6d59a463</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2010</creationdate><topic>65K05</topic><topic>65K05 90C25 90C27 Telecommunication network design Polyhedral uncertainty Robust optimization Min-max-min problems</topic><topic>90C25</topic><topic>90C27</topic><topic>Applied sciences</topic><topic>Communications networks</topic><topic>Computer science; control theory; systems</topic><topic>Computer systems and distributed systems. User interface</topic><topic>Cost reduction</topic><topic>Demand</topic><topic>Exact sciences and technology</topic><topic>Flows in networks. Combinatorial problems</topic><topic>Inventory control, production control. Distribution</topic><topic>Marketing</topic><topic>Mathematical analysis</topic><topic>Mathematical models</topic><topic>Min–max–min problems</topic><topic>Networks</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>Optimization algorithms</topic><topic>Polyhedral uncertainty</topic><topic>Polytopes</topic><topic>Robust optimization</topic><topic>Software</topic><topic>Studies</topic><topic>Telecommunication network design</topic><topic>Telecommunications</topic><topic>Uncertainty</topic><topic>Upper bounds</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Lemaréchal, Claude</creatorcontrib><creatorcontrib>Ouorou, Adam</creatorcontrib><creatorcontrib>Petrou, Georgios</creatorcontrib><collection>Pascal-Francis</collection><collection>RePEc IDEAS</collection><collection>RePEc</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Materials Business File</collection><collection>Materials Research Database</collection><jtitle>European journal of operational research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Lemaréchal, Claude</au><au>Ouorou, Adam</au><au>Petrou, Georgios</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Robust network design in telecommunications under polytope demand uncertainty</atitle><jtitle>European journal of operational research</jtitle><date>2010-11-01</date><risdate>2010</risdate><volume>206</volume><issue>3</issue><spage>634</spage><epage>641</epage><pages>634-641</pages><issn>0377-2217</issn><eissn>1872-6860</eissn><coden>EJORDT</coden><abstract>We consider a model for robust network design in telecommunications, in which we minimize the cost of the maximum mismatch between supply and demand. In the present study, the demand is uncertain and takes its values in a polytope defined by constraints. This problem is hardly tractable, so we limit ourselves to computing lower bounds (by a column-generation mechanism) and upper bounds (using an algorithm due to Falk and Soland for maximizing a separable convex function over a polytope). The experimental gap obtained turns out to be large, and this seems to be mainly due to poor upper bounds. Two possible solutions are suggested for further research aimed at improving them: dc optimization (to minimize the difference of two convex functions) and AARC modeling (affinely adjustable robust counterpart).</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/j.ejor.2010.03.007</doi><tpages>8</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0377-2217 |
| ispartof | European journal of operational research, 2010-11, Vol.206 (3), p.634-641 |
| issn | 0377-2217 1872-6860 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_753751544 |
| source | RePEc; Elsevier ScienceDirect Journals |
| subjects | 65K05 65K05 90C25 90C27 Telecommunication network design Polyhedral uncertainty Robust optimization Min-max-min problems 90C25 90C27 Applied sciences Communications networks Computer science control theory systems Computer systems and distributed systems. User interface Cost reduction Demand Exact sciences and technology Flows in networks. Combinatorial problems Inventory control, production control. Distribution Marketing Mathematical analysis Mathematical models Min–max–min problems Networks Operational research and scientific management Operational research. Management science Optimization algorithms Polyhedral uncertainty Polytopes Robust optimization Software Studies Telecommunication network design Telecommunications Uncertainty Upper bounds |
| title | Robust network design in telecommunications under polytope demand uncertainty |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-19T16%3A02%3A26IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Robust%20network%20design%20in%20telecommunications%20under%20polytope%20demand%20uncertainty&rft.jtitle=European%20journal%20of%20operational%20research&rft.au=Lemar%C3%A9chal,%20Claude&rft.date=2010-11-01&rft.volume=206&rft.issue=3&rft.spage=634&rft.epage=641&rft.pages=634-641&rft.issn=0377-2217&rft.eissn=1872-6860&rft.coden=EJORDT&rft_id=info:doi/10.1016/j.ejor.2010.03.007&rft_dat=%3Cproquest_cross%3E2021439351%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=204148516&rft_id=info:pmid/&rft_els_id=S0377221710001803&rfr_iscdi=true |