Publisher
Springer International Publishing
Reference32 articles.
1. Altin, A., Fortz, B., Thorup, M., Ümit, H.: Intra-domain traffic engineering with shortest path routing protocols. Ann. Oper. Res. 204(1), 65–95 (2013). https://doi.org/10.1007/s10479-012-1270-7
2. Altin, A., Fortz, B., Ümit, H.: Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty. Networks 60(2), 132–139 (2012)
3. Benhamiche, A., Chopin, M.: Toward scalable algorithms for the unsplittable shortest path routing problem. Research report, Orange Labs (2020)
4. Bley, A.: Approximability of unsplittable shortest path routing problems. Networks 54(1), 23–46 (2009)
5. Bley, A.: An integer programming algorithm for routing optimization in IP networks. Algorithmica 60(1), 21–45 (2011)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Unsplittable Shortest Path Routing: Extended Model and Matheuristic;2023 9th International Conference on Control, Decision and Information Technologies (CoDIT);2023-07-03
2. Learning the Bias Weights for Generalized Nested Rollout Policy Adaptation;Lecture Notes in Computer Science;2023
3. GPU for Monte Carlo Search;Lecture Notes in Computer Science;2023