Author:
Bley Andreas,Fortz Bernard,Gourdin Eric,Holmberg Kaj,Klopfenstein Olivier,Pióro Michał,Tomaszewski Artur,Ümit Hakan
Publisher
Springer Berlin Heidelberg
Reference84 articles.
1. Algorithmic Solutions Software GmbH, Schuetzenstrasse 3–5, D-66123 Saarbruecken, Germany: LEDA—Library of Efficient Data types and Algorithms (2000–2007). URL http://www.algorithmic-solutions.com/leda
2. atesio GmbH, Sophie-Taeuber-Arp-Weg 27, D-12205 Berlin, Germany: DISCNET – Network optimization software library (2000–2007). URL http://www.atesio.de
3. Awduche, D.: MPLS and traffic engineering in IP networks. IEEE Communications Magazine 37, 42–47 (1999)
4. Bean, J.: Genetic algorithms and random keys for sequencing and optimization. ORSA J. on Computing 6, 154–160 (1994)
5. Ben-Ameur, W.: Multi-hour design of survivable classical IP networks. International Journal of Communication Systems 15, 553–572 (2002)
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. An enhanced Benders decomposition method for unique shortest path routing;OPSEARCH;2024-02-03
2. Operational Research: methods and applications;Journal of the Operational Research Society;2023-12-27
3. Problem characterization of unique shortest path routing;Computers & Industrial Engineering;2023-04
4. Monte Carlo Search Algorithms for Network Traffic Engineering;Machine Learning and Knowledge Discovery in Databases. Applied Data Science Track;2021
5. Future Networks;Research Anthology on Developing and Optimizing 5G Networks and the Impact on Society;2021