{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T00:17:49Z","timestamp":1774311469240,"version":"3.50.1"},"reference-count":77,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,1,9]],"date-time":"2013-01-09T00:00:00Z","timestamp":1357689600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2013,4]]},"DOI":"10.1007\/s10479-012-1270-7","type":"journal-article","created":{"date-parts":[[2013,1,9]],"date-time":"2013-01-09T04:19:55Z","timestamp":1357705195000},"page":"65-95","source":"Crossref","is-referenced-by-count":28,"title":["Intra-domain traffic engineering with shortest path routing protocols"],"prefix":"10.1007","volume":"204","author":[{"given":"Ay\u015feg\u00fcl","family":"Alt\u0131n","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernard","family":"Fortz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mikkel","family":"Thorup","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hakan","family":"\u00dcmit","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,1,9]]},"reference":[{"key":"1270_CR1","volume-title":"Network flows: theory, algorithms, and applications","author":"R. K. Ahuja","year":"1993","unstructured":"Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network flows: theory, algorithms, and applications. Englewood Cliffs: Prentice Hall."},{"key":"1270_CR2","unstructured":"Alt\u0131n, A., Belotti, P., & Pinar, M. (2006). OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty (Tech. Rep.). Bilkent University."},{"issue":"4","key":"1270_CR3","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/s10288-009-0113-0","volume":"7","author":"A. Altin","year":"2009","unstructured":"Altin, A., Fortz, B., Thorup, M., & \u00dcmit, H. (2009). Intra-domain traffic engineering with shortest path routing protocols. 4OR, 7(4), 301\u2013335.","journal-title":"4OR"},{"issue":"2","key":"1270_CR4","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1002\/net.21461","volume":"60","author":"A. Altin","year":"2012","unstructured":"Altin, A., Fortz, B., & \u00dcmit, H. (2012). Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty. Networks, 60(2), 132\u2013139. http:\/\/dx.doi.org\/10.1002\/net.21461 .","journal-title":"Networks"},{"key":"1270_CR5","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1145\/863955.863991","volume-title":"SIGCOMM \u201903: proceedings of the 2003 conference on applications, technologies, architectures, and protocols for computer communications","author":"D. Applegate","year":"2003","unstructured":"Applegate, D., & Cohen, E. (2003). Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs. In SIGCOMM \u201903: proceedings of the 2003 conference on applications, technologies, architectures, and protocols for computer communications (pp. 313\u2013324). New York: ACM. http:\/\/doi.acm.org\/10.1145\/863955.863991 ."},{"issue":"6","key":"1270_CR6","doi-asserted-by":"crossref","first-page":"1193","DOI":"10.1109\/TNET.2006.886296","volume":"14","author":"D. Applegate","year":"2006","unstructured":"Applegate, D., & Cohen, E. (2006). Making routing robust to changing traffic demands: algorithms and evaluation. IEEE\/ACM Transactions on Networking, 14(6), 1193\u20131206.","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"1270_CR7","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1145\/1375457.1375511","volume-title":"SIGMETRICS \u201908: proceedings of the 2008 ACM SIGMETRICS international conference on measurement and modeling of computer systems","author":"S. Balon","year":"2008","unstructured":"Balon, S., & Leduc, G. (2008). Combined intra- and inter-domain traffic engineering using hot-potato aware link weights optimization. In SIGMETRICS \u201908: proceedings of the 2008 ACM SIGMETRICS international conference on measurement and modeling of computer systems (pp. 441\u2013442). New York: ACM. http:\/\/doi.acm.org\/10.1145\/1375457.1375511 ."},{"key":"1270_CR8","first-page":"316","volume-title":"Proc. of IEEE INFOCOM","author":"S. Balon","year":"2009","unstructured":"Balon, S., & Leduc, G. (2009). BGP-aware IGP link weight optimization in presence of route reflectors. In Proc. of IEEE INFOCOM, Rio de Janeiro, Brazil, 20\u201324 April 2009 (pp. 316\u2013324)."},{"key":"1270_CR9","series-title":"LNCS","volume-title":"Proceedings of IFIP networking 2006","author":"S. Balon","year":"2006","unstructured":"Balon, S., Skiv\u00e9e, F., & Leduc, G. (2006). How well do traffic engineering objective functions meet TE requirements? In LNCS: Vol. 3976. Proceedings of IFIP networking 2006, Coimbra. Berlin: Springer."},{"key":"1270_CR10","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1109\/PADS.2006.6","volume-title":"PADS \u201906: proceedings of the 20th workshop on principles of advanced and distributed simulation","author":"D. Bauer","year":"2006","unstructured":"Bauer, D., Yuksel, M., Carothers, C., & Kalyanaraman, S. (2006). A case study in understanding OSPF and BGP interactions using efficient experiment design. In PADS \u201906: proceedings of the 20th workshop on principles of advanced and distributed simulation (pp. 158\u2013165). Washington: IEEE Comput. Soc. http:\/\/dx.doi.org\/10.1109\/PADS.2006.6 ."},{"key":"1270_CR11","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","volume":"6","author":"J. Bean","year":"1994","unstructured":"Bean, J. (1994). Genetic algorithms and random keys for sequencing and optimization. ORSA Journal on Computing, 6, 154\u2013160.","journal-title":"ORSA Journal on Computing"},{"issue":"1","key":"1270_CR12","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1090\/qam\/102435","volume":"16","author":"R. Bellman","year":"1958","unstructured":"Bellman, R. (1958). On a routing problem. Quarterly of Applied Mathematics, 16(1), 87\u201390.","journal-title":"Quarterly of Applied Mathematics"},{"issue":"3","key":"1270_CR13","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/s11081-007-9033-z","volume":"9","author":"P. Belotti","year":"2008","unstructured":"Belotti, P., & Pinar, M. (2008). Optimal oblivious routing under statistical uncertainty. Optimization and Engineering, 9(3), 257\u2013271.","journal-title":"Optimization and Engineering"},{"key":"1270_CR14","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1002\/dac.551","volume":"15","author":"W. Ben-Ameur","year":"2002","unstructured":"Ben-Ameur, W. (2002). Multi-hour design of survivable classical IP networks. International Journal of Communication Systems, 15, 553\u2013572.","journal-title":"International Journal of Communication Systems"},{"issue":"1","key":"1270_CR15","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1137\/S0895480100377428","volume":"17","author":"W. Ben-Ameur","year":"2003","unstructured":"Ben-Ameur, W., & Gourdin, E. (2003). Internet routing and related topology issues. SIAM Journal on Discrete Mathematics, 17(1), 18\u201349.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"1270_CR16","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/s11081-005-1741-7","volume":"3","author":"W. Ben-Ameur","year":"2005","unstructured":"Ben-Ameur, W., & Kerivin, H. (2005). Routing of uncertain demands. Optimization and Engineering, 3, 283\u2013313.","journal-title":"Optimization and Engineering"},{"key":"1270_CR17","first-page":"56","volume-title":"Proc. international workshop on design of reliable communication networks (DRCN\u20192000)","author":"W. Ben-Ameur","year":"2000","unstructured":"Ben-Ameur, W., Gourdin, E., Liau, B., & Michel, N. (2000a). Dimensioning of internet networks. In Proc. international workshop on design of reliable communication networks (DRCN\u20192000), Munich, Germany (pp. 56\u201361)."},{"key":"1270_CR18","volume-title":"Proc. of networks","author":"W. Ben-Ameur","year":"2000","unstructured":"Ben-Ameur, W., Gourdin, E., Liau, B., & Michel, N. (2000b). Optimizing administrative weights for efficient single-path routing. In Proc. of networks."},{"key":"1270_CR19","first-page":"253","volume-title":"Proc. of 10th international conference on telecommunications (ICT\u20192003)","author":"F. Blanchy","year":"2003","unstructured":"Blanchy, F., M\u00e9lon, L., & Leduc, G. (2003). Routing in a MPLS network featuring preemption mechanisms. In Proc. of 10th international conference on telecommunications (ICT\u20192003) (pp. 253\u2013260). Papeete, Tahiti: IEEE Press."},{"key":"1270_CR20","first-page":"107","volume-title":"Proceedings of the 1st international network optimization conference (INOC 2003)","author":"A. Bley","year":"2003","unstructured":"Bley, A. (2003). A Lagrangian approach for integrated network design and routing in IP networks. In Proceedings of the 1st international network optimization conference (INOC 2003), Paris, France (pp. 107\u2013113)."},{"key":"1270_CR21","first-page":"121","volume-title":"Proceedings of international network optimization conference (INOC 2005)","author":"A. Bley","year":"2005","unstructured":"Bley, A. (2005). Finding small administrative lengths for shortest path routing. In Proceedings of international network optimization conference (INOC 2005), Lisbon, Portugal (pp. 121\u2013128)."},{"issue":"1","key":"1270_CR22","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1002\/net.20163","volume":"50","author":"A. Bley","year":"2007","unstructured":"Bley, A. (2007a). Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths. Networks, 50(1), 29\u201336.","journal-title":"Networks"},{"key":"1270_CR23","unstructured":"Bley, A. (2007b). Routing and capacity optimization for IP networks. PhD thesis, Technische Universit\u00e4t Berlin."},{"key":"1270_CR24","doi-asserted-by":"crossref","unstructured":"Bley, A., & Koch, T. (2002). Integer programming approaches to access and backbone IP-network planning (Tech. Rep. ZR-02-41). ZIB. In Proceedings of 3rd international conference on high performance scientific computing, Hanoi, 2006. http:\/\/dx.doi.org\/10.1007\/978-3-540-79409-7_7 .","DOI":"10.1007\/978-3-540-79409-7_7"},{"key":"1270_CR25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1090\/dimacs\/053\/01","volume":"53","author":"A. Bley","year":"2000","unstructured":"Bley, A., Gr\u00f6tschel, M., & Wess\u00e4ly, R. (2000). Design of broadband virtual private networks: model and heuristics for the B-WIN. Robust Communication Networks: Interconnection and Survivability, 53, 1\u201316.","journal-title":"Robust Communication Networks: Interconnection and Survivability"},{"key":"1270_CR26","first-page":"199","volume-title":"Graphs and algorithms in communication networks: studies in broadband, optical, wireless and ad hoc networks","author":"A. Bley","year":"2010","unstructured":"Bley, A., Fortz, B., Gourdin, E., Holmberg, K., Klopfenstein, O., Pi\u00f3ro, M., Tomaszewski, A., & \u00dcmit, H. (2010). Optimization of OSPF routing in IP networks. In A. M. C. A. Koster & X. Mu\u00f1oz (Eds.), Graphs and algorithms in communication networks: studies in broadband, optical, wireless and ad hoc networks (pp. 199\u2013240). Berlin: Springer. Chap. 8."},{"key":"1270_CR27","first-page":"702","volume-title":"Proc. INOC 2005","author":"P. Brostr\u00f6m","year":"2005","unstructured":"Brostr\u00f6m, P., & Holmberg, K. (2005). Design of IP\/OSPF networks using a Lagrangean heuristic on an in-graph based model. In L. Gouveia & C. Mourao (Eds.), Proc. INOC 2005, University of Lisbon, Lisbon, Portugal (pp. 702\u2013709)."},{"issue":"4","key":"1270_CR28","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1002\/net.20232","volume":"52","author":"P. Brostr\u00f6m","year":"2008","unstructured":"Brostr\u00f6m, P., & Holmberg, K. (2008). Valid cycles: a source of infeasibility in open shortest path first routing. Networks, 52(4), 206\u2013215. http:\/\/dx.doi.org\/10.1002\/net.v52:4 .","journal-title":"Networks"},{"issue":"1","key":"1270_CR29","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1002\/net.20070","volume":"46","author":"L. Buriol","year":"2005","unstructured":"Buriol, L., Resende, M., Ribeiro, C., & Thorup, M. (2005). A hybrid genetic algorithm for the weight setting problem in OSPF\/IS-IS routing. Networks, 46(1), 36\u201356.","journal-title":"Networks"},{"issue":"2","key":"1270_CR30","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1287\/ijoc.1070.0231","volume":"20","author":"L. S. Buriol","year":"2008","unstructured":"Buriol, L. S., Resende, M. G. C., & Thorup, M. (2008). Speeding up dynamic shortest-path algorithms. INFORMS Journal on Computing, 20(2), 191\u2013204. http:\/\/dx.doi.org\/10.1287\/ijoc.1070.0231 .","journal-title":"INFORMS Journal on Computing"},{"key":"1270_CR31","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1109\/ICISP.2006.33","volume-title":"International conference on internet surveillance and protection","author":"S. Cerav-Erbas","year":"2006","unstructured":"Cerav-Erbas, S., Delcourt, O., Fortz, B., & Quoitin, B. (2006). The interaction of IGP weight optimization with BGP. In International conference on internet surveillance and protection (Vol. 0, p.\u00a09). Los Alamitos: IEEE Comput. Soc. http:\/\/doi.ieeecomputersociety.org\/10.1109\/ICISP.2006.33 ."},{"key":"1270_CR32","unstructured":"CISCO (2009). Tunnel builder pro. http:\/\/www.cisco.com\/ ."},{"key":"1270_CR33","first-page":"401","volume-title":"Proc. INOC 2005","author":"L. Giovanni De","year":"2005","unstructured":"De Giovanni, L., Fortz, B., & Labb\u00e9, M. (2005). A lower bound for the internet protocol network design problem. In L. Gouveia (Ed.), Proc. INOC 2005 (pp. 401\u2013407)."},{"issue":"4","key":"1270_CR34","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1023\/B:JONS.0000005472.61905.ca","volume":"11","author":"N. Degrande","year":"2003","unstructured":"Degrande, N., Hoey, G. V., de\u00a0la Vall\u00e9e-Poussin, P., & van\u00a0den Busch, S. (2003). Inter-area traffic engineering in a differentiated services network. Journal of Network and Systems Management, 11(4), 427\u2013445.","journal-title":"Journal of Network and Systems Management"},{"key":"1270_CR35","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E. W. Dijkstra","year":"1959","unstructured":"Dijkstra, E. W. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 1, 269\u2013271.","journal-title":"Numerische Mathematik"},{"key":"1270_CR36","first-page":"1300","volume-title":"Proc. of IEEE INFOCOM","author":"A. Elwalid","year":"2001","unstructured":"Elwalid, A., Jin, C., Low, S., & Widjaja, I. (2001). MATE: MPLS adaptive traffic engineering. In Proc. of IEEE INFOCOM (pp. 1300\u20131309)."},{"key":"1270_CR37","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1023\/A:1014852026591","volume":"6","author":"M. Ericsson","year":"2002","unstructured":"Ericsson, M., Resende, M., & Pardalos, P. (2002). A genetic algorithm for the weight setting problem in OSPF routing. Journal of Combinatorial Optimization, 6, 299\u2013333.","journal-title":"Journal of Combinatorial Optimization"},{"key":"1270_CR38","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/S0166-218X(02)00235-4","volume":"129","author":"A. Farago","year":"2003","unstructured":"Farago, A., Szentesi, A., & Szviatovszki, A. (2003). Inverse optimization in high-speed networks. Discrete Applied Mathematics, 129, 83\u201398.","journal-title":"Discrete Applied Mathematics"},{"key":"1270_CR39","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1109\/65.953233","volume":"15","author":"A. Feldmann","year":"2001","unstructured":"Feldmann, A., & Rexford, J. (2001). IP network configuration for intradomain traffic engineering. IEEE Network, 15, 46\u201357.","journal-title":"IEEE Network"},{"key":"1270_CR40","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1109\/65.826367","volume":"March\/April","author":"A. Feldmann","year":"2000","unstructured":"Feldmann, A., Greenberg, A., Lund, C., Reingold, N., & Rexford, J. (2000). Netscope: traffic engineering for IP networks. IEEE Network, March\/April, 11\u201319.","journal-title":"IEEE Network"},{"key":"1270_CR41","volume-title":"Flows in networks","author":"L. R. Ford","year":"1962","unstructured":"Ford, L. R., & Fulkerson, D. R. (1962). Flows in networks. Princeton: Princeton University Press."},{"key":"1270_CR42","unstructured":"Fortuny, C. (2008). Estimation du trafic, planification et optimisation des ressources pour l\u2019ing\u00e9nierie des r\u00e9seaux IP\/MPLS. PhD thesis, Universit\u00e9 de Toulouse III\u2013Paul Sabatier, UFR Math\u00e9matiques, Informatique, Gestion."},{"key":"1270_CR43","first-page":"1225","volume-title":"Proc. of 19th international teletraffic congress","author":"C. Fortuny","year":"2005","unstructured":"Fortuny, C., Brun, O., & Garcia, J. M. (2005). Metric optimization in IP networks. In Proc. of 19th international teletraffic congress, Beijing, China, September 2005 (pp. 1225\u20131234)."},{"key":"1270_CR44","first-page":"519","volume-title":"Proc. 19th IEEE conf. on computer communications (INFOCOM)","author":"B. Fortz","year":"2000","unstructured":"Fortz, B., & Thorup, M. (2000). Internet traffic engineering by optimizing OSPF weights. In Proc. 19th IEEE conf. on computer communications (INFOCOM) (pp. 519\u2013528)."},{"issue":"4","key":"1270_CR45","doi-asserted-by":"crossref","first-page":"756","DOI":"10.1109\/JSAC.2002.1003042","volume":"20","author":"B. Fortz","year":"2002","unstructured":"Fortz, B., & Thorup, M. (2002). Optimizing OSPF\/IS-IS weights in a changing world. IEEE Journal on Selected Areas in Communications, 20(4), 756\u2013767.","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"1270_CR46","first-page":"225","volume-title":"Proc. INOC 2003","author":"B. Fortz","year":"2003","unstructured":"Fortz, B., & Thorup, M. (2003). Robust optimization of OSPF\/IS-IS weights. In W. Ben-Ameur & A.\u00a0Petrowski (Eds.), Proc. INOC 2003 (pp. 225\u2013230)."},{"issue":"1","key":"1270_CR47","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1023\/B:COAP.0000039487.35027.02","volume":"29","author":"B. Fortz","year":"2004","unstructured":"Fortz, B., & Thorup, M. (2004). Increasing internet capacity using local search. Computational Optimization and Applications, 29(1), 13\u201348.","journal-title":"Computational Optimization and Applications"},{"issue":"3","key":"1270_CR48","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1111\/j.1475-3995.2010.00769.x","volume":"18","author":"B. Fortz","year":"2011","unstructured":"Fortz, B., & \u00dcmit, H. (2011). Efficient techniques and tools for intra-domain traffic engineering. International Transactions in Operational Research, 18(3), 359\u2013376.","journal-title":"International Transactions in Operational Research"},{"key":"1270_CR49","first-page":"177","volume-title":"Proc. 1st Polish-German teletraffic symposium","author":"O. Gajowniczek","year":"2000","unstructured":"Gajowniczek, O., Pi\u00f3ro, M., Szentesi, A., Harmatos, J., & J\u00fcttner, A. (2000). Solving an OSPF routing problem with simulated allocation. In Proc. 1st Polish-German teletraffic symposium, Dresden, Germany (pp. 177\u2013184)."},{"key":"1270_CR50","doi-asserted-by":"crossref","unstructured":"Hawkinson, J. (1996). RFC 1930\u2014guidelines for creation, selection, and registration of an autonomous system (AS).","DOI":"10.17487\/rfc1930"},{"key":"1270_CR51","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1287\/opre.48.3.461.12439","volume":"48","author":"K. Holmberg","year":"2000","unstructured":"Holmberg, K., & Yuan, D. (2000). A Lagrangian heuristic based branch-and-bound approach for the capacitated network design problem. Operations Research, 48, 461\u2013481.","journal-title":"Operations Research"},{"issue":"1","key":"1270_CR52","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1002\/net.10102","volume":"43","author":"K. Holmberg","year":"2004","unstructured":"Holmberg, K., & Yuan, D. (2004). Optimization of internet protocol network design and routing. Networks, 43(1), 39\u201353.","journal-title":"Networks"},{"key":"1270_CR53","volume-title":"Internetworking technologies handbook","author":"Inc CS","year":"2000","unstructured":"Inc CS (2000). Internetworking technologies handbook (3rd ed.). Indianapolis: Cisco Press.","edition":"3"},{"key":"1270_CR54","volume-title":"Proceedings 15th Nordic teletraffic seminar","author":"A. J\u00fcttner","year":"2000","unstructured":"J\u00fcttner, A., Szentesi, A., Harmatos, J., & Pi\u00f3ro, M. (2000). On solvability of an OSPF routing problem. In Proceedings 15th Nordic teletraffic seminar, Lund."},{"key":"1270_CR55","first-page":"884","volume-title":"Proc. of IEEE INFOCOM","author":"M. Kodialam","year":"2000","unstructured":"Kodialam, M., & Lakshman, T. (2000). Minimum interference routing with applications to MPLS routing. In Proc. of IEEE INFOCOM (pp. 884\u2013893)."},{"issue":"5","key":"1270_CR56","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1016\/j.comcom.2005.06.010","volume":"29","author":"G. Leduc","year":"2006","unstructured":"Leduc, G., Abrahamsson, H., Balon, S., Bessler, S., D\u2019Arienzo, M., Delcourt, O., Domingo-Pascual, J., Cerav-Erbas, S., Gojmerac, I., Masip, X., Pescaph, A., Quoitin, B., Romano, S., Salvatori, E., Skiv\u00e9e, F., Tran, H., Uhlig, S., & \u00dcmit, H. (2006). An open source traffic engineering toolbox. Computer Communications, 29(5), 593\u2013610.","journal-title":"Computer Communications"},{"key":"1270_CR57","unstructured":"MATE C (2009). http:\/\/www.cariden.com\/products\/ ."},{"key":"1270_CR58","unstructured":"Mortier, R. (2002). Internet traffic engineering (Tech. Rep. 532). University of Cambridge."},{"key":"1270_CR59","doi-asserted-by":"crossref","unstructured":"Moy, J. (1998). RFC 2328\u2014OSPF Version 2.","DOI":"10.17487\/rfc2328"},{"key":"1270_CR60","first-page":"186","volume-title":"15th ITC specialist seminar","author":"E. Mulyana","year":"2002","unstructured":"Mulyana, E., & Killat, U. (2002). An alternative genetic algorithm to optimize OSPF weights. In 15th ITC specialist seminar, W\u00fcrzburg, Germany (pp. 186\u2013192)."},{"key":"1270_CR61","first-page":"695","volume-title":"Proc. INOC 2005","author":"E. Mulyana","year":"2005","unstructured":"Mulyana, E., & Killat, U. (2005). Optimizing IP networks for uncertain demands using outbound traffic constraints. In Proc. INOC 2005 (pp. 695\u2013701)."},{"key":"1270_CR62","unstructured":"Parmar, A., Ahmed, S., & Sokol, J. (2006). An integer programming approach to the OSPF weight setting problem (Tech. Rep.). School of Industrial & Systems Engineering, Georgia Tech."},{"key":"1270_CR63","volume-title":"Routing, flow, and capacity design in communication and computer networks","author":"M. Pi\u00f3ro","year":"2004","unstructured":"Pi\u00f3ro, M., & Medhi, D. (2004). Routing, flow, and capacity design in communication and computer networks. San Mateo: Morgan Kaufman."},{"key":"1270_CR64","first-page":"70\/1","volume-title":"8th IFIP workshop on performance modelling and evaluation of ATM & IP networks","author":"M. Pi\u00f3ro","year":"2000","unstructured":"Pi\u00f3ro, M., Szentesi, A., Harmatos, J., & J\u00fcttner, A. (2000). On OSPF related network optimization problems. In 8th IFIP workshop on performance modelling and evaluation of ATM & IP networks, Ilkley, UK (pp.\u00a070\/1\u201370\/14)."},{"key":"1270_CR65","unstructured":"QoSDesign (2009). NEST: network engineering and simulation tool. http:\/\/www.qosdesign.com ."},{"issue":"2","key":"1270_CR66","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1006\/jagm.1996.0046","volume":"21","author":"G. Ramalingam","year":"1996","unstructured":"Ramalingam, G., & Reps, T. (1996). An incremental algorithm for a generalization of the shortest-path problem. Journal of Algorithms, 21(2), 267\u2013305.","journal-title":"Journal of Algorithms"},{"key":"1270_CR67","unstructured":"Smit, H., & Li, T. (2003). IS-IS extensions for traffic engineering (Tech. Rep.). Network Working Group, IETF."},{"issue":"1","key":"1270_CR68","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1109\/TNSM.2005.4798297","volume":"2","author":"S. Srivastava","year":"2005","unstructured":"Srivastava, S., Agrawal, G., Pi\u00f3ro, M., & Medhi, D. (2005). Determining link weight system under various objectives for OSPF networks using a Lagrangian relaxation-based approach. IEEE Transactions on Network & Service Management, 2(1), 9\u201318.","journal-title":"IEEE Transactions on Network & Service Management"},{"key":"1270_CR69","volume-title":"Computer networks","author":"A. S. Tanenbaum","year":"2003","unstructured":"Tanenbaum, A. S. (2003). Computer networks (4th ed.). New York: Prentice Hall PTR.","edition":"4"},{"key":"1270_CR70","volume-title":"Proc. INOC 2007","author":"A. Tomaszevski","year":"2007","unstructured":"Tomaszevski, A., Pi\u00f3ro, M., Dzida, M., Mycek, M., & Zagozdzon, M. (2007). Valid inequalities for a shortest-path routing optimization problem. In Proc. INOC 2007."},{"key":"1270_CR71","first-page":"393","volume-title":"Proc. INOC 2005","author":"A. Tomaszewski","year":"2005","unstructured":"Tomaszewski, A., Pi\u00f3ro, M., Dzida, M., & Zagozdzon, M. (2005). Optimization of administrative weights in IP networks using the branch-and-cut approach. In Proc. INOC 2005 (Vol.\u00a02, pp. 393\u2013400)."},{"key":"1270_CR72","first-page":"565","volume-title":"Proceedings of IEEE INFOCOM","author":"Y. Wang","year":"2001","unstructured":"Wang, Y., Wang, Z., & Zhang, L. (2001). Internet traffic engineering without full mesh overlaying. In Proceedings of IEEE INFOCOM (pp. 565\u2013571)."},{"key":"1270_CR73","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1145\/1159913.1159926","volume-title":"SIGCOMM \u201906: proceedings of the 2006 conference on applications, technologies, architectures, and protocols for computer communications","author":"H. Wang","year":"2006","unstructured":"Wang, H., Xie, H., Qiu, L., Yang, Y. R., Zhang, Y., & Greenberg, A. (2006). Cope: traffic engineering in dynamic networks. In SIGCOMM \u201906: proceedings of the 2006 conference on applications, technologies, architectures, and protocols for computer communications (pp. 99\u2013110). New York: ACM. http:\/\/doi.acm.org\/10.1145\/1159913.1159926 ."},{"issue":"9","key":"1270_CR74","doi-asserted-by":"crossref","first-page":"1617","DOI":"10.1109\/49.12889","volume":"6","author":"B. Waxman","year":"1988","unstructured":"Waxman, B. (1988). Routing of multipoint connections. IEEE Journal on Selected Areas in Communications, 6(9), 1617\u20131622.","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"1270_CR75","volume-title":"Proceedings of the eighth INFORMS telecommunications conference","author":"C. Zhang","year":"2006","unstructured":"Zhang, C. (2006). Comparison on objective functions of the unique shortest path problem. In Proceedings of the eighth INFORMS telecommunications conference, Dallas, Texas, USA."},{"key":"1270_CR76","volume-title":"Proceedings ICCS\u20145th international conference","author":"C. Zhang","year":"2005","unstructured":"Zhang, C., & Rodosek, R. (2005). Modelling and constraint hardness characterisation of the unique-path OSPF weight setting problem. In Proceedings ICCS\u20145th international conference, Atlanta, GA, USA."},{"key":"1270_CR77","volume-title":"Proc 24th IEEE conf. on computer communications (INFOCOM)","author":"C. Zhang","year":"2005","unstructured":"Zhang, C., Liu, Y., Gong, W., Kurose, J., & Moll, R. (2005). On optimal routing with multiple traffic matrices. In Proc 24th IEEE conf. on computer communications (INFOCOM)."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-012-1270-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-012-1270-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-012-1270-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,20]],"date-time":"2020-07-20T02:22:55Z","timestamp":1595211775000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-012-1270-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1,9]]},"references-count":77,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,4]]}},"alternative-id":["1270"],"URL":"https:\/\/doi.org\/10.1007\/s10479-012-1270-7","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,1,9]]}}}