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

Authors:
Chungmok Lee;Kyungsik Lee;Kyungchul Park;Sungsoo Park
Affiliations:
IT Convergence Technology Research Laboratory, Electronics and Telecommunications Research Institute, Yuseong-gu, Daejeon 305-700, Republic of Korea, Department of Industrial and Systems Engineeri ...;Department of Industrial and Management Engineering, Hankuk University of Foreign Studies, Mohyeon-myon, Yongin-si, Gyeonggi-do 449-791, Republic of Korea;College of Business Administration, Myongji University, Namgaja-dong, Seodaemun-gu, Seoul 120-728, Republic of Korea;Department of Industrial and Systems Engineering, KAIST, Guseong-dong, Yuseong-gu, Daejeon 305-701, Republic of Korea
Venue:
Operations Research
Year:
2012

Citing 11
Cited 1

Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
High-speed networks: TCP/IP and ATM design principles

High-speed networks: TCP/IP and ATM design principles
Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems

Operations Research
The Price of Robustness

Operations Research
Adjustable robust solutions of uncertain linear programs

Mathematical Programming: Series A and B
Provisioning virtual private networks under traffic uncertainty

Networks - Special Issue on Multicommodity Flows and Network Design
Selected topics in robust convex optimization

Mathematical Programming: Series A and B
SNDlib 1.0—Survivable Network Design Library

Networks - Network Optimization (INOC 2007)
The Robust Network Loading Problem Under Hose Demand Uncertainty: Formulation, Polyhedral Analysis, and Computations

INFORMS Journal on Computing
On cut-based inequalities for capacitated network design polyhedra

Networks
Traffic engineering with MPLS in the Internet

IEEE Network: The Magazine of Global Internetworking

Exact solution of the robust knapsack problem

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

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.