• About
  • Policies
  • What is open access
  • Library
  • Contact
Advanced search
      View Item 
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Industrial Engineering
      • View Item
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Industrial Engineering
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

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

      Thumbnail
      View / Download
      340.3 Kb
      Author(s)
      Altın, A.
      Yaman, H.
      Pınar, M. Ç.
      Date
      2011
      Source Title
      INFORMS Journal on Computing
      Print ISSN
      1091-9856
      Electronic ISSN
      1526-5528
      Publisher
      Institute for Operations Research and the Management Sciences (I N F O R M S)
      Volume
      23
      Issue
      1
      Pages
      75 - 89
      Language
      English
      Type
      Article
      Item Usage Stats
      131
      views
      268
      downloads
      Abstract
      We 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.
      Keywords
      Branch and cut
      Hose model
      Network loading problem
      Polyhedral analysis
      Polyhedral demand uncertainty
      Robust optimization
      Permalink
      http://hdl.handle.net/11693/21678
      Published Version (Please cite this version)
      http://dx.doi.org/10.1287/ijoc.1100.0380
      Collections
      • Department of Industrial Engineering 702
      Show full item record

      Browse

      All of BUIRCommunities & CollectionsTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsThis CollectionTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartments

      My Account

      LoginRegister

      Statistics

      View Usage StatisticsView Google Analytics Statistics

      Bilkent University

      If you have trouble accessing this page and need to request an alternate format, contact the site administrator. Phone: (312) 290 1771
      © Bilkent University - Library IT

      Contact Us | Send Feedback | Off-Campus Access | Admin | Privacy