Branch-and-cut strategies for a multi-period network design and routing problem

Authors :: Dimitri Papadimitriou
Bernard Fortz
Graphes et Optimisation Mathématique [Bruxelles] (GOM)
Université libre de Bruxelles (ULB)
Alcatel-Lucent Bell - Belgique
Alacatel Lucent
Fortz, Bernard
Source :: Control, Decision and Information Technologies (CoDIT), 2014 International Conference on, Control, Decision and Information Technologies (CoDIT), 2014 International Conference on, 2014, Unknown, Unknown Region. pp.128-133, CoDIT
Publication Year :: 2014
Publisher :: HAL CCSD, 2014.
Abstract: Language of publication: en; International audience; no abstract

Subjects :: Static routing
Mathematical optimization
021103 operations research
[INFO.INFO-RO] Computer Science [cs]/Operations Research [cs.RO]
Routing table
Policy-based routing
0211 other engineering and technologies
0102 computer and information sciences
02 engineering and technology
[INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO]
01 natural sciences
Routing domain
Link-state routing protocol
010201 computation theory & mathematics
Multipath routing
Branch and cut
Hierarchical routing
ComputingMilieux_MISCELLANEOUS
Mathematics

Language :: English
Database :: OpenAIRE
Journal :: Control, Decision and Information Technologies (CoDIT), 2014 International Conference on, Control, Decision and Information Technologies (CoDIT), 2014 International Conference on, 2014, Unknown, Unknown Region. pp.128-133, CoDIT
Accession number :: edsair.doi.dedup.....2c4eb5fa64184b24c56867466e65ecfd

Tools