Technical Note-Branch-and-Price-and-Cut Approach to the Robust Network Design Problem Without Flow Bifurcations

Cited 10 time in webofscience Cited 0 time in scopus
  • Hit : 398
  • Download : 5
This paper presents a robust optimization approach to the network design problem under traffic demand uncertainty. We consider the specific case of the network design problem in which there are several alternatives in edge capacity installations and the traffic cannot be split over several paths. A new decomposition approach is proposed that yields a strong LP relaxation and enables traffic demand uncertainty to be addressed efficiently through localization of the uncertainty to each edge of the underlying network. A branch-and-price-and-cut algorithm is subsequently developed and tested on a set of benchmark instances.
Publisher
INFORMS
Issue Date
2012-05
Language
English
Article Type
Article
Keywords

DEMAND UNCERTAINTY; OPTIMIZATION

Citation

OPERATIONS RESEARCH, v.60, no.3, pp.604 - 610

ISSN
0030-364X
DOI
10.1287/opre.1120.1049
URI
http://hdl.handle.net/10203/102421
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
000306645500009.pdf(200.2 kB)Download
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 10 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0