{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T00:21:23Z","timestamp":1768522883621,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":84,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642022494","type":"print"},{"value":"9783642022500","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02250-0_8","type":"book-chapter","created":{"date-parts":[[2009,11,17]],"date-time":"2009-11-17T11:17:06Z","timestamp":1258456626000},"page":"199-240","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Optimization of OSPF Routing in IP Networks"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Bley","sequence":"first","affiliation":[]},{"given":"Bernard","family":"Fortz","sequence":"additional","affiliation":[]},{"given":"Eric","family":"Gourdin","sequence":"additional","affiliation":[]},{"given":"Kaj","family":"Holmberg","sequence":"additional","affiliation":[]},{"given":"Olivier","family":"Klopfenstein","sequence":"additional","affiliation":[]},{"given":"Micha\u0142","family":"Pi\u00f3ro","sequence":"additional","affiliation":[]},{"given":"Artur","family":"Tomaszewski","sequence":"additional","affiliation":[]},{"given":"Hakan","family":"\u00dcmit","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,11,9]]},"reference":[{"key":"8_CR1","unstructured":"Algorithmic Solutions Software GmbH, Schuetzenstrasse 3\u20135, D-66123 Saarbruecken, Germany: LEDA\u2014Library of Efficient Data types and Algorithms (2000\u20132007). URL http:\/\/www.algorithmic-solutions.com\/leda"},{"key":"8_CR2","unstructured":"atesio GmbH, Sophie-Taeuber-Arp-Weg 27, D-12205 Berlin, Germany: DISCNET \u2013 Network optimization software library (2000\u20132007). URL http:\/\/www.atesio.de"},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1109\/35.809383","volume":"37","author":"D. Awduche","year":"1999","unstructured":"Awduche, D.: MPLS and traffic engineering in IP networks. IEEE Communications Magazine 37, 42\u201347 (1999)","journal-title":"IEEE Communications Magazine"},{"key":"8_CR4","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","volume":"6","author":"J. Bean","year":"1994","unstructured":"Bean, J.: Genetic algorithms and random keys for sequencing and optimization. ORSA J. on Computing 6, 154\u2013160 (1994)","journal-title":"ORSA J. on Computing"},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1002\/dac.551","volume":"15","author":"W. Ben-Ameur","year":"2002","unstructured":"Ben-Ameur, W.: Multi-hour design of survivable classical IP networks. International Journal of Communication Systems 15, 553\u2013572 (2002)","journal-title":"International Journal of Communication Systems"},{"issue":"1","key":"8_CR6","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1137\/S0895480100377428","volume":"17","author":"W. Ben-Ameur","year":"2003","unstructured":"Ben-Ameur, W., Gourdin, E.: Internet routing and related topology issues. SIAM Journal on Discrete Mathematics 17(1), 18\u201349 (2003)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"8_CR7","volume-title":"Dimensioning of Internet networks.","author":"W. Ben-Ameur","year":"2000","unstructured":"Ben-Ameur, W., Gourdin, E., Liau, B., Michel, N.: Dimensioning of Internet networks. In: Proceedings of the 2nd International Workshop on the Design of Reliable Communication Networks (DRCN 2000), Munich, Germany (2000)"},{"key":"8_CR8","unstructured":"Ben-Ameur, W., Gourdin, E., Liau, B., Michel, N.: Optimizing administrative weights for efficient single-path routing. In: Proceedings of Networks 2000 (2000)"},{"key":"8_CR9","first-page":"107","volume-title":"A Lagrangian approach for integrated network design and routing in IP networks.","author":"A. Bley","year":"2003","unstructured":"Bley, A.: 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 (2003)"},{"key":"8_CR10","first-page":"121","volume-title":"Finding small administrative lengths for shortest path routing.","author":"A. Bley","year":"2005","unstructured":"Bley, A.: Finding small administrative lengths for shortest path routing. In: Proceedings of the 2nd International Network Optimization Conference (INOC 2005), Lisbon, Portugal, vol. 1, pp. 121\u2013128 (2005)"},{"key":"8_CR11","first-page":"97","volume-title":"On the approximability of the minimum congestion unsplittable shortest path routing problem.","author":"A. Bley","year":"2005","unstructured":"Bley, A.: On the approximability of the minimum congestion unsplittable shortest path routing problem. In: Proceedings of the 11th Conference on Integer Programming and Combinatorial Optimization (IPCO 2005), Berlin, Germany, pp. 97\u2013110 (2005)"},{"issue":"1","key":"8_CR12","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1002\/net.20163","volume":"50","author":"A. Bley","year":"2007","unstructured":"Bley, A.: Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths. Networks 50(1), 29\u201336 (2007)","journal-title":"Networks"},{"key":"8_CR13","unstructured":"Bley, A.: Routing and capacity optimization for IP networks. Ph.D. thesis, Technische Univertit\u00e4t Berlin (2007)"},{"key":"8_CR14","first-page":"198","volume-title":"An integer programming algorithm for routing optimization in IP networks.","author":"A. Bley","year":"2008","unstructured":"Bley, A.: An integer programming algorithm for routing optimization in IP networks. In: Proceedings of the 16th Annual European Symposium on Algorithms (ESA 2008), Karlsruhe, Germany, pp. 198\u2013209 (2008)"},{"issue":"1","key":"8_CR15","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1002\/net.20303","volume":"54","author":"A. Bley","year":"2009","unstructured":"Bley, A.: Approximability of unsplittable shortest path routing problems. Networks 54(1), 23\u201346 (2009)","journal-title":"Networks"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Bley, A., Gr\u00f6tschel, M., Wess\u00e4ly, R.: Design of broadband virtual private networks: Model and heuristics for the B-WiN. In: N. Dean, D. Hsu, R. Ravi (eds.) Robust Communication Networks: Interconnection and Survivability, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 53, pp. 1\u201316. American Mathematical Society (1998)","DOI":"10.1090\/dimacs\/053\/01"},{"key":"8_CR17","first-page":"13","volume":"54","author":"A. Bley","year":"2000","unstructured":"Bley, A., Koch, T.: Optimierung des G-WiN. DFN-Mitteilungen 54, 13\u201315 (2000)","journal-title":"DFN-Mitteilungen"},{"key":"8_CR18","first-page":"87","volume-title":"Integer programming approaches to access and backbone IP-network planning.","author":"A. Bley","year":"2006","unstructured":"Bley, A., Koch, T.: Integer programming approaches to access and backbone IP-network planning. In: Modeling, Simulation and Optimization of Complex Processes: Proceedings of the 3rd International Conference on High Performance Scientific Computing, pp. 87\u2013110. Hanoi, Vietnam (2006)"},{"key":"8_CR19","first-page":"4","volume":"67","author":"A. Bley","year":"2005","unstructured":"Bley, A., Pattloch, M.: Modellierung und Optimierung der X-WiN Plattform. DFN-Mitteilungen 67, 4\u20137 (2005)","journal-title":"DFN-Mitteilungen"},{"key":"8_CR20","first-page":"119","volume-title":"Optimal shortest path routing for Internet networks.","author":"N. Bourquia","year":"2003","unstructured":"Bourquia, N., Ben-Ameur, W., Gourdin, E., Tolla, P.: Optimal shortest path routing for Internet networks. In: Proceedings of the 1st International Network Optimization Conference (INOC 2003), Paris, France, pp. 119\u2013125 (2003)"},{"key":"8_CR21","unstructured":"Brostr\u00f6m, P.: Optimization models and methods for telecommunication networks using OSPF. PhD dissertation, Link\u00f6ping University, Sweden (2006). Link\u00f6ping Studies in Science and Technology. Dissertation no. 1032"},{"key":"8_CR22","unstructured":"Brostr\u00f6m, P., Holmberg, K.: Determining the non-existence of compatibel OSPF weights. In: D. Yuan (ed.) Nordic MPS 2004, no. 14 in Link\u00f6ping Electronic Conference Proceedings, pp. 7\u201321. Link\u00f6ping University Electronic Press (2004)"},{"key":"8_CR23","unstructured":"Brostr\u00f6m, P., Holmberg, K.: Design of IP\/OSPF networks using a Lagrangean heuristic on an in-graph based model. In: L. Gouveia, C. Mourao (eds.) INOC 2005, pp. 702\u2013709. University of Lisbon, Lisbon, Portugal (2005)"},{"key":"8_CR24","unstructured":"Brostr\u00f6m, P., Holmberg, K.: Determining the non-existance of a compatible OSPF metric. In: L. Gouveia, C. Mourao (eds.) INOC 2005, pp. 702\u2013709. University of Lisbon, Lisbon, Portugal (2005)"},{"key":"8_CR25","doi-asserted-by":"crossref","unstructured":"Brostr\u00f6m, P., Holmberg, K.: Multiobjective design of survivable IP networks. Annals of Operations Research 147 (2006)","DOI":"10.1007\/s10479-006-0067-y"},{"key":"8_CR26","unstructured":"Brostr\u00f6m, P., Holmberg, K.: Design of OSPF networks using subpath consistent routing patterns. Research Report LiTH-MAT-R-2007-05, Department of Mathematics, Link\u00f6ping Institute of Technology, Sweden (2007). Under revision for publication."},{"issue":"4","key":"8_CR27","first-page":"507","volume":"35","author":"P. Brostr\u00f6m","year":"2007","unstructured":"Brostr\u00f6m, P., Holmberg, K.: On the extremal structure of an OSPF related cone. Vietnam Journal on Mathematics 35(4), 507\u2013522 (2007)","journal-title":"Vietnam Journal on Mathematics"},{"issue":"4","key":"8_CR28","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1002\/net.20232","volume":"52","author":"P. Brostr\u00f6m","year":"2008","unstructured":"Brostr\u00f6m, P., Holmberg, K.: Valid cycles: A source of infeasibility in OSPF routing. Networks 52(4), 206\u2013215 (2008)","journal-title":"Networks"},{"key":"8_CR29","first-page":"19","volume":"4","author":"P. Brostr\u00f6m","year":"2009","unstructured":"Brostr\u00f6m, P., Holmberg, K.: Compatible weights and valid cycles in non-spanning OSPF routing patterns. Algorithmic Operations Research 4, 19\u201335 (2009)","journal-title":"Algorithmic Operations Research"},{"issue":"1","key":"8_CR30","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1002\/net.20070","volume":"46","author":"L. S. Buriol","year":"2005","unstructured":"Buriol, L. S., Resende, M. G. C., Ribeiro, C. C., Thorup, M.: A hybrid genetic algorithm for the weight setting problem in OSPF\/IS-IS routing. Networks 46(1), 36\u201356 (2005)","journal-title":"Networks"},{"issue":"2","key":"8_CR31","doi-asserted-by":"publisher","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.: Speeding Up Dynamic Shortest-Path Algorithms. INFORMS Journal On Computing 20(2), 191\u2013204 (2008)","journal-title":"INFORMS Journal On Computing"},{"key":"8_CR32","volume-title":"On the inverse shortest path problem.","author":"D. Burton","year":"1993","unstructured":"Burton, D.: On the inverse shortest path problem. Ph.D. thesis, Department of Mathematics, Facult\u00e9s Universitaires ND de la Paix, Namur, Belgium (1993)"},{"key":"8_CR33","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/BF01585693","volume":"53","author":"D. Burton","year":"1992","unstructured":"Burton, D., Toint, P.: On an instance of the inverse shortest paths problem. Mathematical Programming 53, 45\u201361 (1992)","journal-title":"Mathematical Programming"},{"key":"8_CR34","volume-title":"\u017botkiewicz, M.: Three methods for optimizing single-shortest path routing.","author":"M. Dzida","year":"2008","unstructured":"Dzida, M., Petterson, M., Duelli, M., Zago\u017cd\u017con, M., Pi\u00f3ro, M., Menth, M., \u017botkiewicz, M.: Three methods for optimizing single-shortest path routing. In: NGI 2008 Conference on Next Generation Internet Networks, Cracow, Poland (2008)"},{"key":"8_CR35","volume-title":"Optimization of resilient weight systems for shortest-path routing in IP networks.","author":"M. Dzida","year":"2007","unstructured":"Dzida, M., Zago\u017cd\u017con, M., Pi\u00f3ro, M.: Optimization of resilient weight systems for shortest-path routing in IP networks. In: 6th International Workshop on Design and Reliable Communication Networks. La Rochelle, France (2007)"},{"key":"8_CR36","first-page":"386","volume-title":"A set-based approach to the optimal IGP weight setting problem.","author":"A. Eremin","year":"2005","unstructured":"Eremin, A., Ajili, F., Rodosek, R.: A set-based approach to the optimal IGP weight setting problem. In: Proceedings of the 2nd International Network Optimization Conference (INOC 2005), Lisbon, Portugal, vol. 1, pp. 386\u2013392 (2005)"},{"key":"8_CR37","doi-asserted-by":"crossref","unstructured":"Ericsson, M., Resende, M. G. C., P. M., P.: A genetic algorithm for the weight setting problem in OSPF routing. J. of Combinatorial Optimization 6, 299\u2013333 (2002)","DOI":"10.1023\/A:1014852026591"},{"key":"8_CR38","first-page":"621","volume-title":"Allocation of administrative weights in PNNI.","author":"A. Farago","year":"1998","unstructured":"Farago, A., Szentesi, A., Szviatovszki, B.: Allocation of administrative weights in PNNI. In: Proceedings of Networks \u201998, Sorrento, Italy, pp. 621\u2013625 (1998)"},{"key":"8_CR39","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/S0166-218X(02)00235-4","volume":"129","author":"A. Farago","year":"2003","unstructured":"Farago, A., Szentesi, A., Szviatovszki, B.: Inverse optimization in high-speed networks. Discrete Applied Mathematics 129, 83\u201398 (2003)","journal-title":"Discrete Applied Mathematics"},{"key":"8_CR40","doi-asserted-by":"crossref","unstructured":"Fekete, S., Hochst\u00e4ttler, W., Kromberg, S., Moll, C.: The complexity of an inverse shortest path problem. In: R. Graham, J. Kratochv\u00edl, J. Nesetril, F. Roberts (eds.) Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, vol. 49, pp. 113\u2013127. AMS (1999)","DOI":"10.1090\/dimacs\/049\/06"},{"key":"8_CR41","first-page":"11","volume":"14","author":"A. Feldmann","year":"2000","unstructured":"Feldmann, A., Greenberg, A., Lund, C., Reingold, N., Rexford, J.: NetScope: Traffic engineering for IP networks. IEEE Transactions on Networking 14, 11\u201319 (2000)","journal-title":"IEEE Transactions on Networking"},{"key":"8_CR42","doi-asserted-by":"crossref","unstructured":"Fortz, B., Thorup, M.: Internet traffic engineering by optimizing OSPF weights. In: Proceedings of IEEE INFOCOM\u201900, pp. 519\u2013528 (2000)","DOI":"10.1109\/INFCOM.2000.832225"},{"issue":"4","key":"8_CR43","doi-asserted-by":"publisher","first-page":"756","DOI":"10.1109\/JSAC.2002.1003042","volume":"20","author":"B. Fortz","year":"2002","unstructured":"Fortz, B., Thorup, M.: Optimizing OSPF\/IS-IS weights in a changing world. IEEE Journal on Selected Areas in Communications 20(4), 756\u2013767 (2002)","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"8_CR44","unstructured":"Fortz, B., Thorup, M.: Robust optimization of OSPF\/IS-IS weights. In: W. Ben-Ameur, A. Petrowski (eds.) Proc. INOC 2003, pp. 225\u2013230 (2003)"},{"issue":"1","key":"8_CR45","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1023\/B:COAP.0000039487.35027.02","volume":"29","author":"B. Fortz","year":"2004","unstructured":"Fortz, B., Thorup, M.: Increasing Internet capacity using local search. Computational Optimization and Applications 29(1), 13\u201348 (2004)","journal-title":"Computational Optimization and Applications"},{"key":"8_CR46","first-page":"177","volume-title":"Solving an OSPF routing problem with simulated allocation.","author":"P. Gajowniczek","year":"2000","unstructured":"Gajowniczek, P., Pi\u00f3ro, M., Szentesi, A., Harmatos, J., J\u00fcttner, A.: Solving an OSPF routing problem with simulated allocation. In: Proceedings of 1st Polish-German Teletraffic Symposium, pp. 177\u2013184. Dresden, Germany (2000)"},{"issue":"1","key":"8_CR47","first-page":"48","volume":"25","author":"M. Gerla","year":"1977","unstructured":"Gerla, M., Kleinrock, L.: Communication nets: stochastic message flow and delay 25(1), 48\u201360 (1977)","journal-title":"Communication nets: stochastic message flow and delay"},{"key":"8_CR48","first-page":"402","volume-title":"A lower bound for the Internet protocol network design problem.","author":"L. de Giovanni","year":"2005","unstructured":"de Giovanni, L., Fortz, B., Labb\u00e9, M.: A lower bound for the Internet protocol network design problem. In: Proceedings of the 2nd International Network Optimization Conference (INOC 2005), Lisbon, Portugal, vol. 1, pp. 402\u2013408 (2005)"},{"issue":"2","key":"8_CR49","first-page":"46","volume":"28","author":"E. Gourdin","year":"2001","unstructured":"Gourdin, E.: Optimizing internet networks. ORMS Today 28(2), 46\u201349 (2001)","journal-title":"ORMS Today"},{"key":"8_CR50","unstructured":"Gourdin, E., Klopfenstein, O.: Comparison of different QoS-oriented objectives for multicommodity flow routing optimization. In: Proceedings of the International Conference on Telecommunications (ICT 2006) (2006)"},{"key":"8_CR51","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1287\/opre.48.3.461.12439","volume":"48","author":"K. Holmberg","year":"2000","unstructured":"Holmberg, K., Yuan, D.: A Lagrangian heuristic based branch-and-bound approach for the capacitated network design problem. Operations Research 48, 461\u2013481 (2000)","journal-title":"Operations Research"},{"issue":"1","key":"8_CR52","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1002\/net.10102","volume":"43","author":"K. Holmberg","year":"2004","unstructured":"Holmberg, K., Yuan, D.: Optimization of Internet protocol network design and routing. Networks 43(1), 39\u201353 (2004)","journal-title":"Networks"},{"key":"8_CR53","unstructured":"ILOG CPLEX Division, 889 Alder Avenue, Suite 200, Incline Village, NV 89451, USA: CPLEX 11.0 Reference Manual (2007). URL http:\/\/www.cplex.com"},{"key":"8_CR54","unstructured":"J\u00fcttner A. Szentesi, A., Harmatos, J., Pi\u00f3ro, M.: On solvability of an OSPF routing problem. In: Proc. 15th Nordic Teletraffic Seminar (2000)"},{"key":"8_CR55","unstructured":"Karas, P., Pi\u00f3ro, M.: Optimization problems related to the assignment of administrative weights in the IP networks routing protocols. In: Proceedings of the 1st Polish-German Teletraffic Symposium PGTS\u20192000, pp. 185\u2013192 (2000)"},{"key":"8_CR56","doi-asserted-by":"crossref","unstructured":"Klopfenstein, O., Mamy, S.: Choosing weights for IP network dimensioning optimization. In: Proc. of the International Symposium on Computers and Communications (ISCC 2006), pp. 994\u2013999 (2006)","DOI":"10.1109\/ISCC.2006.49"},{"issue":"5","key":"8_CR57","doi-asserted-by":"publisher","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.: An open source traffic engineering toolbox. Computer Communications, 29(5), 593\u2013610 (2006)","journal-title":"Computer Communications"},{"key":"8_CR58","doi-asserted-by":"crossref","unstructured":"Lin, F., Wang, J.: Minimax open shortest path first routing algorithms in networks suporting the SMDS service. In: Proceedings of the IEEE International Conference on Communications 1993 (ICC\u201993), Geneva, Suisse, vol. 2, pp. 666\u2013670 (1993)","DOI":"10.1109\/ICC.1993.397358"},{"key":"8_CR59","volume-title":"Robust IP link costs for multilayer resilience.","author":"M. Menth","year":"2007","unstructured":"Menth, M., Hartmann, M., Martin, R.: Robust IP link costs for multilayer resilience. In: Networking. Atlanta, GA, USA (2007)"},{"key":"8_CR60","unstructured":"Milbrandt, J.: Possibilities of routing optimization in IP networks. Master\u2019s thesis, Department of Computer Science, University of W\u00fcrzburg (2001)"},{"key":"8_CR61","unstructured":"Moy, J.: OSPF: Anatomy of an Internet Routing Protocol. Addison-Wesley (1998)"},{"key":"8_CR62","unstructured":"Mulyana, E., Killat, U.: An alternative genetic algorithm to optimize OSPF weights. In: Internet Traffic Engineering and Traffic Management, 15th ITC Specialist Seminar, pp. 186\u2013192 (July 2002). W\u00fcrzburg, Germany"},{"key":"8_CR63","doi-asserted-by":"crossref","unstructured":"Nemhauser, G., Wolsey, L.: Integer and Combinatorial Optimization. John Wiley & Sons (1988)","DOI":"10.1002\/9781118627372"},{"key":"8_CR64","doi-asserted-by":"crossref","unstructured":"Nucci, A., Schroeder, B., Bhattacharyya, S., Taft, N., Diot, C.: IGP link weight assignment for transient link failures. In: Proceedings of 18th International Teletraffic Congress, pp. 321\u2013330 (2003)","DOI":"10.1016\/S1388-3437(03)80177-4"},{"key":"8_CR65","doi-asserted-by":"crossref","unstructured":"Oran, D.: OSI IS-IS intra-domain routing protocol. Internet RFC 1142 (1990). http:\/\/www.ietf.org\/rfc\/rfc1142.txt","DOI":"10.17487\/rfc1142"},{"key":"8_CR66","unstructured":"Orlowski, S., Pi\u00f3ro, M., Tomaszewski, A., Wess\u00e4ly, R.: SNDlib 1.0\u2013Survivable Network Design Library. In: Proceedings of the 3rd International Network Optimization Conference (INOC 2007), Spa, Belgium (2007). http:\/\/sndlib.zib.de"},{"key":"8_CR67","unstructured":"Parmar, A., Ahmed, S., Sokol, J.: An integer programming approach to the OSPF weight setting problem. Optimization Online (2005)"},{"key":"8_CR68","doi-asserted-by":"crossref","unstructured":"Pi\u00f3ro, M., Medhi, D.: Routing, Flow, and Capacity Design in Communication and Computer Networks. Morgan Kaufman (2004)","DOI":"10.1016\/B978-012557189-0\/50011-1"},{"key":"8_CR69","unstructured":"Pi\u00f3ro, M., Szentesi, A., Harmatos, J., J\u00fcttner, A.: On OSPF related network optimization problems. In: 8th IFIP Workshop on Performance Modelling and Evaluation of ATM & IP Networks, pp. 70\/1\u201370\/14. Ilkley, UK (2000)"},{"key":"8_CR70","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/S0166-5316(02)00036-6","volume":"48","author":"M. Pi\u00f3ro","year":"2002","unstructured":"Pi\u00f3ro, M., Szentesi, A., Harmatos, J., J\u00fcttner, A., Gajowniczek, P., Kozdrowski, S.: On OSPF related network optimization problems. Performance Evaluation 48, 201\u2013223 (2002). (A preliminary version of this paper appeared in the proc. IFIP ATM IP 2000, Ilkley, England, July 2000)","journal-title":"Performance Evaluation"},{"key":"8_CR71","volume-title":"Feasibility issues in shortest-path routing with traffic flow split.","author":"M. Pi\u00f3ro","year":"2007","unstructured":"Pi\u00f3ro, M., Tomaszewski, A.: Feasibility issues in shortest-path routing with traffic flow split. In: Proceedings of the 3rd International Network Optimization Conference (INOC 2007), Spa, Belgium (2007)"},{"key":"8_CR72","unstructured":"Pi\u00f3ro, M., Tomaszewski, A., Dzida, M., Mycek, M., Zago\u017cd\u017con, M.: Literature survey, models, polyhedral results, and exact and heuristic methods for shortest-path routing problems. Technical report, Institute of Telecommunications, Warsaw University of Technology (2007)"},{"key":"8_CR73","volume-title":"On optimization in design of telecommunications networks with multicast and unicast traffic.","author":"M. Prytz","year":"2002","unstructured":"Prytz, M.: On optimization in design of telecommunications networks with multicast and unicast traffic. Ph.D. thesis, Royal Institute of Technology, Stockholm, Sweden (2002)"},{"issue":"2","key":"8_CR74","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1006\/jagm.1996.0046","volume":"21","author":"G. Ramalingam","year":"1996","unstructured":"Ramalingam, G., Reps, T.: An incremental algorithm for a generalization of the shortest-path problem. Jounal of Algorithms 21(2), 267\u2013305 (1996)","journal-title":"Jounal of Algorithms"},{"key":"8_CR75","unstructured":"Rexford, J.: Handbook of Optimization in Telecommunications, chap. Route optimization in IP networks (2006)"},{"issue":"1","key":"8_CR76","doi-asserted-by":"publisher","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.: Determining link weight system under various objectives for OSPF networks using a lagrangean relaxation-based approach. IEEE e-Transactions on Network and Service Management 2(1), 9\u201318 (2005)","journal-title":"IEEE e-Transactions on Network and Service Management"},{"key":"8_CR77","unstructured":"Staehle, D., K\u00f6hler, S., Kohlhaas, U.: Towards an optimization of the routing parameters for IP networks. Technical Report TR 258, Department of Computer Science, University of W\u00fcrzburg (2000)"},{"key":"8_CR78","volume-title":"Valid inequalities for a shortest-path routing optimization problem.","author":"A. Tomaszewski","year":"2007","unstructured":"Tomaszewski, A., Pi\u00f3ro, M., Dzida, M., Mycek, M., Zago\u017cd\u017con, M.: Valid inequalities for a shortest-path routing optimization problem. In: Proceedings of the 3rd International Network Optimization Conference (INOC 2007), Spa, Belgium (2007)"},{"key":"8_CR79","first-page":"393","volume-title":"Optimization of administrative weights in IP networks using the branch-and-cut approach.","author":"A. Tomaszewski","year":"2005","unstructured":"Tomaszewski, A., Pi\u00f3ro, M., Dzida, M., Zago\u017cd\u017con, M.: Optimization of administrative weights in IP networks using the branch-and-cut approach. In: Proceedings of the 2nd International Network Optimization Conference (INOC 2005), Lisbon, Portugal, vol. 2, pp. 393\u2013400 (2005)"},{"key":"8_CR80","unstructured":"Tong, C., Lam, K.: An embedded connectionist approach for the inverse shortest paths problem. Technical report, Department of Systems Engineering and Engineering Management, The Chinese University of Hong Kong (1996)"},{"key":"8_CR81","unstructured":"\u00dcmit, H., Fortz, B.: Fast heuristic techniques for intra-domain routing metric optimization. In: Proc. INOC 2007 (2007)"},{"key":"8_CR82","volume-title":"Interenet traffic engineering without full mesh overlaying.","author":"Y. Wang","year":"2001","unstructured":"Wang, Y., Wang, Z., Zhang, L.: Interenet traffic engineering without full mesh overlaying. In: Proc. INFOCOM\u20192001 (2001). New York, USA"},{"key":"8_CR83","unstructured":"Wolsey, L.: Integer Programming. John Wiley & Sons (1998)"},{"key":"8_CR84","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1109\/65.826369","volume":"14","author":"X. Xiao","year":"2000","unstructured":"Xiao, X., Hannan, A., Bailey, B., Ni, L.: Traffic engineering with MPLS in the Internet. IEEE Network 14, 28\u201333 (2000)","journal-title":"IEEE Network"}],"container-title":["Texts in Theoretical Computer Science. An EATCS Series","Graphs and Algorithms in Communication Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02250-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,13]],"date-time":"2025-02-13T08:23:13Z","timestamp":1739434993000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-02250-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642022494","9783642022500"],"references-count":84,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02250-0_8","relation":{},"ISSN":["1862-4499"],"issn-type":[{"value":"1862-4499","type":"print"}],"subject":[],"published":{"date-parts":[[2009]]},"assertion":[{"value":"9 November 2009","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}