{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T10:28:54Z","timestamp":1648981734341},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2009,5,7]],"date-time":"2009-05-07T00:00:00Z","timestamp":1241654400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Telecommun Syst"],"published-print":{"date-parts":[[2009,8]]},"DOI":"10.1007\/s11235-009-9162-0","type":"journal-article","created":{"date-parts":[[2009,5,6]],"date-time":"2009-05-06T17:17:40Z","timestamp":1241630260000},"page":"293-309","source":"Crossref","is-referenced-by-count":1,"title":["Design of OSPF networks using subpath consistent routing patterns"],"prefix":"10.1007","volume":"41","author":[{"given":"Peter","family":"Brostr\u00f6m","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaj","family":"Holmberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,5,7]]},"reference":[{"key":"9162_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. New York: Prentice Hall."},{"key":"9162_CR2","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, 18\u201349.","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"3","key":"9162_CR3","first-page":"145","volume":"2","author":"W. Ben-Ameur","year":"2001","unstructured":"Ben-Ameur, W., Michel, N., Liau, B., & Gourdin, E. (2001). Routing strategies for IP networks. Telektronikk, 2(3), 145\u2013158.","journal-title":"Telektronikk"},{"key":"9162_CR4","unstructured":"Bley, A. (2003). A Lagrangian approach for integrated network design and routing in IP networks. In Proceedings of 1st international network optimization conference INOC 2003 (pp.\u00a0107\u2013113)."},{"key":"9162_CR5","unstructured":"Bley, A., & Koch, T. (2002). Integer programming approaches to access and backbone IP-network planning (Technical report ZR-02-41). Konrad-Zuse-Zentrum f\u00fcr Informationstechnik, Berlin."},{"key":"9162_CR6","series-title":"DIMACS series in discrete mathematics and theoretical computer science","first-page":"1","volume-title":"Robust communication networks: interconnection and survivability","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. In N. Dean, D. F. Hsu & R. Rav (Eds.), DIMACS series in discrete mathematics and theoretical computer science : Vol. 53. Robust communication networks: interconnection and survivability (pp.\u00a01\u201316). Providence: AMS."},{"key":"9162_CR7","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.), INOC 2005 (pp.\u00a0702\u2013709). University of Lisbon, Lisbon, Portugal."},{"key":"9162_CR8","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/s10479-006-0067-y","volume":"147","author":"P. Brostr\u00f6m","year":"2006","unstructured":"Brostr\u00f6m, P., & Holmberg, K. (2006). Multiobjective design of survivable IP networks. Annals of Operations Research, 147, 235\u2013253.","journal-title":"Annals of Operations Research"},{"key":"9162_CR9","first-page":"19","volume":"4","author":"P. Brostr\u00f6m","year":"2009","unstructured":"Brostr\u00f6m, P., & Holmberg, K. (2009). Compatible weights and valid cycles in non-spanning OSPF routing patterns. Algorithmic Operations Research, 4, 19\u201335.","journal-title":"Algorithmic Operations Research"},{"key":"9162_CR10","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 OSPF routing. Networks, 52, 206\u2013215.","journal-title":"Networks"},{"key":"9162_CR11","first-page":"1396","volume":"14","author":"Y. J. Chu","year":"1965","unstructured":"Chu, Y. J., & Liu, T. H. (1965). On the shortest arborescence of a directed graph. Science Sinica, 14, 1396\u20131400.","journal-title":"Science Sinica"},{"key":"9162_CR12","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/S0166-218X(00)00310-3","volume":"112","author":"T. G. Crainic","year":"2001","unstructured":"Crainic, T. G., Frangioni, A., & Gendron, B. (2001). Bundle-based relaxation methods for multicommodity capacitated fixed charge network design. Discrete Applied Mathematics, 112, 73\u201399.","journal-title":"Discrete Applied Mathematics"},{"key":"9162_CR13","unstructured":"De Giovanni, L., Fortz, B., & Labb\u00e9, M. (2005). A lower bound for the Internet protocol network design problem. In L. Gouveia & C.\u00a0Mourao (Eds.), INOC 2005 (pp.\u00a0401\u2013408), University of Lisbon, Lisbon, Portugal."},{"key":"9162_CR14","doi-asserted-by":"crossref","first-page":"233","DOI":"10.6028\/jres.071B.032","volume":"71B","author":"J. Edmonds","year":"1967","unstructured":"Edmonds, J. (1967). Optimum branchings. Journal of research of the National Bureau of Standards, 71B, 233\u2013240.","journal-title":"Journal of research of the National Bureau of Standards"},{"issue":"4","key":"9162_CR15","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1287\/ijoc.5.4.426","volume":"5","author":"M. Fischetti","year":"1993","unstructured":"Fischetti, M., & Toth, P. (1993). An efficient algorithm for the min-sum arborescence problem on complete digraphs. ORSA Journal on Computing, 5(4), 426\u2013434.","journal-title":"ORSA Journal on Computing"},{"key":"9162_CR16","first-page":"111","volume-title":"Handbook of Combinatorics","author":"A. Frank","year":"1995","unstructured":"Frank, A. (1995). Connectivity and network flows. In A. Graham, M. Gr\u00f6tschel & L. Lov\u00e1sz (Eds.), Handbook of Combinatorics (Vol.\u00a01, pp.\u00a0111\u2013177). Amsterdam: North-Holland."},{"key":"9162_CR17","volume-title":"Graphs and algorithms","author":"M. Gondran","year":"1984","unstructured":"Gondran, M., & Minoux, M. (1984). Graphs and algorithms. New York: Wiley\u2013Interscience."},{"key":"9162_CR18","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/BF01580223","volume":"6","author":"M. Held","year":"1974","unstructured":"Held, M., Wolfe, P., & Crowder, H. P. (1974). Validation of subgradient optimization. Mathematical Programming, 6, 62\u201388.","journal-title":"Mathematical Programming"},{"key":"9162_CR19","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1111\/j.1475-3995.1998.tb00135.x","volume":"5","author":"K. Holmberg","year":"1998","unstructured":"Holmberg, K., & Yuan, D. (1998). A Lagrangean approach to network design problems. International Transactions in Operational Research, 5, 529\u2013539.","journal-title":"International Transactions in Operational Research"},{"key":"9162_CR20","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, 39\u201353.","journal-title":"Networks"},{"key":"9162_CR21","volume-title":"OSPF: Anatomy of an Internet routing protocol","author":"J. Moy","year":"1998","unstructured":"Moy, J. (1998). OSPF: Anatomy of an Internet routing protocol. Reading: Addison\u2013Wesley."},{"key":"9162_CR22","first-page":"593","volume":"8","author":"B. T. Poljak","year":"1967","unstructured":"Poljak, B. T. (1967). A general method of solving extremum problems. Soviet Mathematics Doklady, 8, 593\u2013597.","journal-title":"Soviet Mathematics Doklady"},{"key":"9162_CR23","unstructured":"Prytz, M. (2002). On optimization in design of telecommunications networks with multicast and unicast traffic. PhD dissertation, Royal Institute of Technology, Sweden. TRITA-MAT-02-OS-05."},{"key":"9162_CR24","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-82118-9","volume-title":"Minimization methods for non-differentiable functions","author":"N. Z. Shor","year":"1985","unstructured":"Shor, N. Z. (1985). Minimization methods for non-differentiable functions. Berlin: Springer."},{"key":"9162_CR25","unstructured":"SNDlib 1.0 (2005). SNDlib 1.0\u2014survivable network design data library. http:\/\/sndlib.zib.de ."},{"key":"9162_CR26","unstructured":"Staehle, D., K\u00f6hler, S., & Kohlhaas, U. (2000). Towards an optimization of the routing parameters for IP networks (Technical report 258). Department of Computer Science, University of W\u00fcrzburg, Germany."},{"key":"9162_CR27","unstructured":"Tomaszewski, A., Pioro, M., Dzida, M., & Zagozdzon, M. (2005). Optimization of administrative weights in IP networks using the branch-and-cut approach. In L. Gouveia & C. Mourao (Eds.), INOC 2005 (pp.\u00a0393\u2013400), University of Lisbon, Lisbon, Portugal."}],"container-title":["Telecommunication Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11235-009-9162-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11235-009-9162-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11235-009-9162-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T06:47:12Z","timestamp":1559371632000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11235-009-9162-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5,7]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,8]]}},"alternative-id":["9162"],"URL":"https:\/\/doi.org\/10.1007\/s11235-009-9162-0","relation":{},"ISSN":["1018-4864","1572-9451"],"issn-type":[{"value":"1018-4864","type":"print"},{"value":"1572-9451","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,5,7]]}}}