The robust network loading problem under hose demand uncertainty: formulation, polyhedral analysis, and computations

Simple item page
dc.citation.epage89en_US
dc.citation.issueNumber1en_US
dc.citation.spage75en_US
dc.citation.volumeNumber23en_US
dc.contributor.authorAltın, A.en_US
dc.contributor.authorYaman, H.en_US
dc.contributor.authorPınar, M. Ç.en_US
dc.date.accessioned2016-02-08T09:49:38Z
dc.date.available2016-02-08T09:49:38Z
dc.date.issued2011en_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.description.abstractWe consider the network loading problem (NLP) under a polyhedral uncertainty description of traffic demands. After giving a compact multicommodity flow formulation of the problem, we state a decomposition property obtained from projecting out the flow variables. This property considerably simplifies the resulting polyhedral analysis and computations by doing away with metric inequalities. Then we focus on a specific choice of the uncertainty description, called the "hose model," which specifies aggregate traffic upper bounds for selected endpoints of the network. We study the polyhedral aspects of the NLP under hose demand uncertainty and use the results as the basis of an efficient branch-and-cut algorithm. The results of extensive computational experiments on well-known network design instances are reported.en_US
dc.description.provenanceMade available in DSpace on 2016-02-08T09:49:38Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 2011en
dc.identifier.doi10.1287/ijoc.1100.0380en_US
dc.identifier.eissn1526-5528
dc.identifier.issn1091-9856
dc.identifier.urihttp://hdl.handle.net/11693/21678
dc.language.isoEnglishen_US
dc.publisherInstitute for Operations Research and the Management Sciences (I N F O R M S)en_US
dc.relation.isversionofhttp://dx.doi.org/10.1287/ijoc.1100.0380en_US
dc.source.titleINFORMS Journal on Computingen_US
dc.subjectBranch and cuten_US
dc.subjectHose modelen_US
dc.subjectNetwork loading problemen_US
dc.subjectPolyhedral analysisen_US
dc.subjectPolyhedral demand uncertaintyen_US
dc.subjectRobust optimizationen_US
dc.titleThe robust network loading problem under hose demand uncertainty: formulation, polyhedral analysis, and computationsen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
The_robust_network_loading_problem_under_hose_demand_uncertainty_formulation,_polyhedral_analysis,_and_computations.pdf
Size:
340.35 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Department of Industrial Engineering