{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,9]],"date-time":"2025-12-09T15:33:34Z","timestamp":1765294414361},"reference-count":78,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2009,11,1]],"date-time":"2009-11-01T00:00:00Z","timestamp":1257033600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2009,11]]},"DOI":"10.1007\/s10288-009-0113-0","type":"journal-article","created":{"date-parts":[[2009,12,1]],"date-time":"2009-12-01T16:39:21Z","timestamp":1259685561000},"page":"301-335","source":"Crossref","is-referenced-by-count":21,"title":["Intra-domain traffic engineering with shortest path routing protocols"],"prefix":"10.1007","volume":"7","author":[{"given":"Ay\u015feg\u00fcl","family":"Alt\u0131n","sequence":"first","affiliation":[]},{"given":"Bernard","family":"Fortz","sequence":"additional","affiliation":[]},{"given":"Mikkel","family":"Thorup","sequence":"additional","affiliation":[]},{"given":"Hakan","family":"\u00dcmit","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,12,2]]},"reference":[{"key":"113_CR1","volume-title":"Network flows: theory, algorithms, and applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: theory, algorithms, and applications. Prentice Hall, Englewood Cliffs"},{"key":"113_CR2","unstructured":"Alt\u0131n A, Belotti P, P\u0131nar M (2006) OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty. Technical report, Bilkent University"},{"key":"113_CR3","unstructured":"Alt\u0131n A, Fortz B, \u00dcmit H (2008) Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty. Technical report 588, ULB Computer Science Department, http:\/\/www.ulb.ac.be\/\/di\/publications\/RT_2008.html"},{"key":"113_CR4","unstructured":"Alt\u0131n A, Fortz B, \u00dcmit H (2009) Oblivious OSPF routing with weight optimization under polyhedral uncertainty. In: Proceedings of the 3rd international network optimization conference (INOC 2009), Pisa, Italy"},{"key":"113_CR5","doi-asserted-by":"crossref","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, ACM, New York, NY, USA, pp 313\u2013324, doi: 10.1145\/863955.863991","DOI":"10.1145\/863955.863991"},{"key":"113_CR6","doi-asserted-by":"crossref","unstructured":"Applegate D, Cohen E (2006) Making routing robust to changing traffic demands: algorithms and evaluation. IEEE\/ACM Trans Netw","DOI":"10.1109\/TNET.2006.886296"},{"key":"113_CR7","doi-asserted-by":"crossref","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, ACM, New York, NY, USA, pp 441\u2013442, doi: 10.1145\/1375457.1375511","DOI":"10.1145\/1375457.1375511"},{"key":"113_CR8","doi-asserted-by":"crossref","unstructured":"Balon S, Leduc G (2009) BGP-aware IGP link weight optimization in presence of route reflectors. In: Proceedings of IEEE INFOCOM, Rio de Janeiro, Brazil, pp 316\u2013324","DOI":"10.1109\/INFCOM.2009.5061935"},{"key":"113_CR9","doi-asserted-by":"crossref","unstructured":"Balon S, Skiv\u00e9e F, Leduc G (2006) How well do traffic engineering objective functions meet TE requirements? In: Proceedings of IFIP Networking 2006, vol 3976, Coimbra, Springer LNCS","DOI":"10.1007\/11753810_7"},{"key":"113_CR10","doi-asserted-by":"crossref","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, IEEE Computer Society, Washington, DC, USA, pp 158\u2013165, doi: 10.1109\/PADS.2006.6","DOI":"10.1109\/PADS.2006.6"},{"key":"113_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 J Comput 6: 154\u2013160","journal-title":"ORSA J Comput"},{"issue":"1","key":"113_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. Q Appl Math 16(1): 87\u201390","journal-title":"Q Appl Math"},{"issue":"3","key":"113_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, P\u0131nar M (2008) Optimal oblivious routing under statistical uncertainty. Optim Eng 9(3): 257\u2013271","journal-title":"Optim Eng"},{"key":"113_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. Int J Commun Syst 15: 553\u2013572","journal-title":"Int J Commun Syst"},{"issue":"1","key":"113_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 J Discrete Math 17(1): 18\u201349","journal-title":"SIAM J Discrete Math"},{"key":"113_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. Optim Eng 3: 283\u2013313","journal-title":"Optim Eng"},{"key":"113_CR17","unstructured":"Ben-Ameur W, Gourdin E, Liau B, Michel N (2000a) Dimensioning of Internet networks. In: Proceedings international workshop on design of reliable communication networks (DRCN\u20192000), Munich, Germany, pp 56\u201361"},{"key":"113_CR18","unstructured":"Ben-Ameur W, Gourdin E, Liau B, Michel N (2000b) Optimizing administrative weights for efficient single-path routing. In: Proceedings of Networks"},{"key":"113_CR19","doi-asserted-by":"crossref","unstructured":"Blanchy F, M\u00e9lon L, Leduc G (2003) Routing in a MPLS network featuring preemption mechanisms. In: Proceedings of 10th international conference on telecommunications (ICT\u20192003), IEEE Press, Papeete, Tahiti, pp 253\u2013260","DOI":"10.1109\/ICTEL.2003.1191228"},{"key":"113_CR20","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":"113_CR21","unstructured":"Bley A (2005) Finding small administrative lengths for shortest path routing. In: Proceedings of international network optimization conference (INOC 2005), pp 121\u2013128, Lisbon, Portugal"},{"issue":"1","key":"113_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":"113_CR23","unstructured":"Bley A (2007b) Routing and capacity optimization for IP networks. PhD thesis, Technische Univertit\u00e4t Berlin"},{"key":"113_CR24","unstructured":"Bley A, Koch T (2002) Integer programming approaches to access and backbone IP-network planning. Technical report ZR-02-41, ZIB, to appear. In: Proceedings of 3rd international conference on high performance scientific computing, 2006, Hanoi"},{"key":"113_CR25","first-page":"1","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 bwin. Robust Commun Netw: Interconnect Surviv 53: 1\u201316","journal-title":"Robust Commun Netw: Interconnect Surviv"},{"key":"113_CR26","unstructured":"Bley A, Fortz B, Gourdin E, Holmberg K, Pi\u00f3ro M, Tomaszsewski A, \u00dcmit H (2009) Graphs and algorithms (COST 293). Springer (in preparation)"},{"key":"113_CR27","unstructured":"Brostr\u00f6m P, Holmberg K (2005) Design of IP\/OSPF networks using a Lagrangean heuristic on an in-graph based model. In: Gouveia L, Mourao C (eds) Proceedings of INOC 2005, University of Lisbon, Lisbon, Portugal, pp 702\u2013709"},{"issue":"4","key":"113_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, doi: 10.1002\/net.v52:4","journal-title":"Networks"},{"issue":"1","key":"113_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\u2013IS routing. Networks 46(1): 36\u201356","journal-title":"Networks"},{"issue":"2","key":"113_CR30","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1287\/ijoc.1070.0231","volume":"20","author":"LS Buriol","year":"2008","unstructured":"Buriol LS, Resende MGC, Thorup M (2008) Speeding up dynamic shortest-path algorithms. INFORMS J Comput 20(2): 191\u2013204. doi: 10.1287\/ijoc.1070.0231","journal-title":"INFORMS J Comput"},{"key":"113_CR31","doi-asserted-by":"crossref","unstructured":"Cerav-Erbas S, Delcourt O, Fortz B, Quoitin B (2006) The interaction of igp weight optimization with bgp. In: Internet surveillance and protection, international conference on, IEEE Computer Society, Los Alamitos, CA, USA, vol 0, p 9, doi: 10.1109\/ICISP.2006.33","DOI":"10.1109\/ICISP.2006.33"},{"key":"113_CR32","unstructured":"CISCO (2009) Tunnel builder pro. http:\/\/www.cisco.com\/"},{"key":"113_CR33","unstructured":"De Giovanni L, Fortz B, Labb\u00e9 M (2005) A lower bound for the Internet protocol network design problem. In: Gouveia L (ed) Proceedings of INOC 2005, pp 401\u2013407"},{"issue":"4","key":"113_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 GV, de la Vall\u00e9e-Poussin P, van den Busch S (2003) Inter-area traffic engineering in a differentiated services network. J Netw Syst Manage 11(4): 427\u2013445","journal-title":"J Netw Syst Manage"},{"key":"113_CR35","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra EW (1959) A note on two problems in connexion with graphs. Numerische Mathematik 1: 269\u2013271","journal-title":"Numerische Mathematik"},{"key":"113_CR36","doi-asserted-by":"crossref","unstructured":"Elwalid A, Jin C, Low S, Widjaja I (2001) MATE: MPLS adaptive traffic engineering. In: Proceedings of IEEE INFOCOM, pp 1300\u20131309","DOI":"10.1109\/INFCOM.2001.916625"},{"key":"113_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. J Comb Optim 6: 299\u2013333","journal-title":"J Comb Optim"},{"key":"113_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 Appl Math 129: 83\u201398","journal-title":"Discrete Appl Math"},{"key":"113_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 Netw Mag 15: 46\u201357","journal-title":"IEEE Netw Mag"},{"key":"113_CR40","doi-asserted-by":"crossref","unstructured":"Feldmann A, Greenberg A, Lund C, Reingold N, Rexford J (2000) Netscope: traffic engineering for IP networks. IEEE Netw Mag 11\u201319","DOI":"10.1109\/65.826367"},{"key":"113_CR41","volume-title":"Flows in networks","author":"LR Ford","year":"1962","unstructured":"Ford LR, Fulkerson DR (1962) Flows in networks. Princeton University Press, Princeton"},{"key":"113_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\u2014Paul Sabatier, UFR Math\u00e9matiques, Informatique, Gestion"},{"key":"113_CR43","unstructured":"Fortuny C, Brun O, Garcia JM (September 2005) Metric optimization in IP networks. In: Proceedings of 19th international teletraffic congress, Beijing, China, pp 1225\u20131234"},{"key":"113_CR44","doi-asserted-by":"crossref","unstructured":"Fortz B, Thorup M (2000) Internet traffic engineering by optimizing ospf weights. In: Proceedings of 19th IEEE Conference on Computer Communications (INFOCOM), pp 519\u2013528","DOI":"10.1109\/INFCOM.2000.832225"},{"issue":"4","key":"113_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\u2013IS weights in a changing world. IEEE J Sel Areas Commun 20(4): 756\u2013767","journal-title":"IEEE J Sel Areas Commun"},{"key":"113_CR46","unstructured":"Fortz B, Thorup M (2003) Robust optimization of OSPF\/IS\u2013IS weights. In: Ben-Ameur W, Petrowski A (eds) Proceedings of INOC 2003, pp 225\u2013230"},{"issue":"1","key":"113_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. Comput Optim Appl 29(1): 13\u201348","journal-title":"Comput Optim Appl"},{"key":"113_CR48","unstructured":"Gajowniczek O, Pi\u00f3ro M, Szentesi A, Harmatos J, J\u00fcttner A (2000) Solving an OSPF routing problem with simulated allocation. In: Proceedings of 1st Polish-German teletraffic symposium, Dresden, Germany, pp 177\u2013184"},{"key":"113_CR49","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":"113_CR50","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. Oper Res 48: 461\u2013481","journal-title":"Oper Res"},{"issue":"1","key":"113_CR51","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":"113_CR52","volume-title":"Internetworking technologies handbook","author":"Inc CS","year":"2000","unstructured":"Inc CS: (2000) Internetworking technologies handbook. 3. Cisco Press, Indianapolis","edition":"3"},{"key":"113_CR53","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":"113_CR54","unstructured":"Kodialam M, Lakshman T (2000) Minimum interference routing with applications to mpls routing. In: Proceedigs of IEEE INFOCOM, pp 884\u2013893"},{"issue":"5","key":"113_CR55","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, H (2006) An open source traffic engineering toolbox. Comput Commun 29(5): 593\u2013610","journal-title":"Comput Commun"},{"key":"113_CR56","unstructured":"MATE C (2009) http:\/\/www.cariden.com\/products\/"},{"key":"113_CR57","volume-title":"Internet traffic engineering. Tech. Rep. 532","author":"R Mortier","year":"2002","unstructured":"Mortier R (2002) Internet traffic engineering. Tech. Rep. 532. University of Cambridge, Cambridge"},{"key":"113_CR58","doi-asserted-by":"crossref","unstructured":"Moy J (1998) RFC 2328\u2014OSPF version 2","DOI":"10.17487\/rfc2328"},{"key":"113_CR59","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":"113_CR60","unstructured":"Mulyana E, Killat U (2005) Optimizing IP networks for uncertain demands using outbound traffic constraints. In: Proceedings of INOC 2005, pp 695\u2013701"},{"key":"113_CR61","unstructured":"Parmar A, Ahmed S, Sokol J (2006) An integer programming approach to the OSPF weight setting problem. Technical report, School of Industrial & Systems Engineering, Georgia Technology"},{"key":"113_CR62","doi-asserted-by":"crossref","unstructured":"Pi\u00f3ro M, Medhi D (2004) Routing, flow, and capacity design in communication and computer networks. Morgan Kaufman","DOI":"10.1016\/B978-012557189-0\/50011-1"},{"key":"113_CR63","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 70\/1\u201370\/14"},{"key":"113_CR64","unstructured":"QoSDesign (2009) NEST: Network Engineering and Simulation Tool. http:\/\/www.qosdesign.com"},{"issue":"2","key":"113_CR65","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. J Algorithms 21(2): 267\u2013305","journal-title":"J Algorithms"},{"key":"113_CR66","unstructured":"Smit H, Li T (2003) IS\u2013IS extensions for traffic engineering. Technical report, Network Working Group, IETF"},{"issue":"1","key":"113_CR67","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 e-Trans Netw & Serv Manage 2(1): 9\u201318","journal-title":"IEEE e-Trans Netw & Serv Manage"},{"key":"113_CR68","volume-title":"Computer networks","author":"AS Tanenbaum","year":"2003","unstructured":"Tanenbaum AS (2003) Computer networks. 4. Prentice Hall PTR, Upper Saddle River","edition":"4"},{"key":"113_CR69","unstructured":"Tomaszevski A, Pi\u00f3ro M, Dzida M, Mycek M, Zagozdzon M (2007) Valid inequalities for a shortest-path routing optimization problem. In: Proceedings of INOC 2007"},{"key":"113_CR70","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: Proceedings of INOC 2005, vol 2, pp 393\u2013400"},{"key":"113_CR71","doi-asserted-by":"crossref","unstructured":"\u00dcmit H (2005) A column generation approach for IGP weight setting problem. In: Proceedings of CoNEXT 2005, Toulouse, France, pp 294\u2013295","DOI":"10.1145\/1095921.1095987"},{"key":"113_CR72","unstructured":"\u00dcmit H, Fortz B (2007) Fast heuristic techniques for intra-domain routing metric optimization. In: Proceedings of the 2nd international network optimization conference (INOC 2007), Spa, Belgium"},{"key":"113_CR73","unstructured":"Wang Y, Wang Z, Zhang L (2001) Internet traffic engineering without full mesh overlaying. In: Proceedings of IEEE INFOCOM, pp 565\u2013571"},{"key":"113_CR74","doi-asserted-by":"crossref","unstructured":"Wang H, Xie H, Qiu L, Yang YR, 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, ACM, New York, NY, USA, pp 99\u2013110, doi: 10.1145\/1159913.1159926","DOI":"10.1145\/1159913.1159926"},{"issue":"9","key":"113_CR75","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 J Sel Areas Commun 6(9): 1617\u20131622","journal-title":"IEEE J Sel Areas Commun"},{"key":"113_CR76","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":"113_CR77","doi-asserted-by":"crossref","unstructured":"Zhang C, Rodosek R (2005) Modelling and constraint hardness characterisation of the unique-path OSPF weight setting problem. In: Proceedings ICCS-5th international conference, Atlanta, GA, USA","DOI":"10.1007\/11428831_100"},{"key":"113_CR78","unstructured":"Zhang C, Liu Y, Gong W, Kurose J, Moll R (2005) On optimal routing with multiple traffic matrices. In: Proceedings of 24th IEEE Conference on Computer Communications (INFOCOM)"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-009-0113-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-009-0113-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-009-0113-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T12:12:56Z","timestamp":1559131976000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-009-0113-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,11]]},"references-count":78,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,11]]}},"alternative-id":["113"],"URL":"https:\/\/doi.org\/10.1007\/s10288-009-0113-0","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,11]]}}}