DocumentCode
1781588
Title
Branch-and-cut strategies for a multi-period network design and routing problem
Author
Fortz, Bernard ; Papadimitriou, Dimitri
Author_Institution
Dept. d´Inf., Univ. Libre de Bruxelles, Brussels, Belgium
fYear
2014
fDate
3-5 Nov. 2014
Firstpage
128
Lastpage
133
Abstract
The combined network design and (distributed) traffic routing problem can be formulated as a large-scale multi-period mixed integer optimization problem. This problem combines network design decisions and routing decisions, with time-dependent traffic demands. In this paper, we consider different branch-and-cut strategies for solving the problem with the base and extended formulations proposed in our prior work.
Keywords
integer programming; network theory (graphs); tree searching; branch-and-cut strategies; distributed traffic routing problem; large-scale multiperiod mixed integer optimization problem; multiperiod network design problem; multiperiod network routing problem; Maintenance engineering; Network topology; Optimization; Resource management; Routing; Topology; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Control, Decision and Information Technologies (CoDIT), 2014 International Conference on
Conference_Location
Metz
Type
conf
DOI
10.1109/CoDIT.2014.6996881
Filename
6996881
Link To Document