BROWSE
Detail
Journal Article
Technical Note—Branch-and-Price-and-Cut Approach to the Robust Network Design Problem Without Flow Bifurcations
Cited 25 time in 
Share 
Share
- Authors
- Chungmok Lee, Kyungsik Lee, Kyungchul Park, Sungsoo Park
- Issue Date
- 2012-08
- Citation
- Operations Research, v.60, no.3, pp.604-610
- ISSN
- 0030-364X
- Publisher
- INFORMS
- Language
- English
- Type
- Journal Article
- Abstract
- 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. © 2012 INFORMS.
- KSP Keywords
- Benchmark instances, Branch-and-Price, Decomposition approach, LP relaxation, Network Design Problem, Robust network design, Traffic Demand, demand uncertainty, optimization approach, robust optimization(RO)