{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:58:20Z","timestamp":1725559100287},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540260325"},{"type":"electronic","value":"9783540321118"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11428831_100","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T00:14:05Z","timestamp":1279066445000},"page":"804-811","source":"Crossref","is-referenced-by-count":3,"title":["Modelling and Constraint Hardness Characterisation of the Unique-Path OSPF Weight Setting Problem"],"prefix":"10.1007","author":[{"given":"Changyong","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Rodosek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"100_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.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs (1993)"},{"key":"100_CR2","unstructured":"Ameur, W.B., Bourquia, N., Gourdin, E., Tolla, P.: Optimal Routing for Efficient Internet Networks. In: Proc. of ECUMN, pp. 10\u201317 (2002)"},{"issue":"1","key":"100_CR3","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1137\/S0895480100377428","volume":"17","author":"W.B. Ameur","year":"2003","unstructured":"Ameur, W.B., Gourdin, E.: Internet Routing and Related Topology Issues. SIAM J. on Discrete Mathematics\u00a017(1), 18\u201349 (2003)","journal-title":"SIAM J. on Discrete Mathematics"},{"key":"100_CR4","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"J. Benders","year":"1962","unstructured":"Benders, J.: Partitioning Procedures for Solving Mixed-Variables Programming Problems. Numerische Mathematik\u00a04, 238\u2013252 (1962)","journal-title":"Numerische Mathematik"},{"key":"100_CR5","volume-title":"Data Networks","author":"D. Bertsekas","year":"1992","unstructured":"Bertsekas, D., Gallager, R.: Data Networks, 2nd edn. Prentice-Hall, Englewood Cliffs (1992)","edition":"2"},{"key":"100_CR6","volume-title":"IP Routing Protocols: RIP, OSPF, BGP, PNNI and Cisco Routing Protocols","author":"U. Black","year":"2000","unstructured":"Black, U.: IP Routing Protocols: RIP, OSPF, BGP, PNNI and Cisco Routing Protocols. Prentice-Hall, Englewood Cliffs (2000)"},{"key":"100_CR7","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1023\/A:1014852026591","volume":"6","author":"M. Ericsson","year":"2002","unstructured":"Ericsson, M., Resende, M.G.C., Pardalos, P.M.: A Genetic Algorithm for the Weight Setting Problem in OSPF Routing. J. of Combinatorial Optimization\u00a06, 299\u2013333 (2002)","journal-title":"J. of Combinatorial Optimization"},{"issue":"3","key":"100_CR8","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1109\/90.929850","volume":"9","author":"A. Feldmann","year":"2001","unstructured":"Feldmann, A., Greenberg, A., Lund, C., Reingold, N., Rexford, J., True, F.: Deriving Traffic Demands for Operational IP Networks: Methodology and Experience. IEEE\/ACM Transactions on Networking\u00a09(3), 265\u2013279 (2001)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"100_CR9","doi-asserted-by":"crossref","unstructured":"Fortz, B., Thorup, M.: Internet Traffic Engineering by Optimizing OSPF Weights. In: Proc. of INFOCOM, pp. 519\u2013528 (2000)","DOI":"10.1109\/INFCOM.2000.832225"},{"key":"100_CR10","unstructured":"ILOG Inc.: ILOG CPLEX 6.5 User\u2019s Manual (1999)"},{"key":"100_CR11","unstructured":"Imperial College London: ECLiPSe 5.7 User\u2019s Manual (2003)"},{"key":"100_CR12","doi-asserted-by":"crossref","unstructured":"Lin, F.Y.S., Wang, J.L.: Minimax Open Shortest Path First Routing Algorithms in Networks Supporting the SMDS Services. In: Proc. of ICC, vol.\u00a02, pp. 666\u2013670 (1993)","DOI":"10.1109\/ICC.1993.397358"},{"key":"100_CR13","volume-title":"OSPF Anatomy of an Internet Routing Protocol","author":"J. Moy","year":"1998","unstructured":"Moy, J.: OSPF Anatomy of an Internet Routing Protocol. Addison-Wesley, Reading (1998)"},{"issue":"3","key":"100_CR14","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1002\/net.10110","volume":"43","author":"W. Ouaja","year":"2004","unstructured":"Ouaja, W., Richards, B.: A Hybrid Multicommodity Routing Algorithm for Traffic Engineering. Networks\u00a043(3), 125\u2013140 (2004)","journal-title":"Networks"},{"key":"100_CR15","doi-asserted-by":"crossref","unstructured":"Ramakrishnan, K.G., Rodrigues, M.A.: Optimal Routing in Shortest-Path Data Network. Bell Labs Technical Journal, 117\u2013138 (January-June 2001)","DOI":"10.1002\/bltj.2267"},{"key":"100_CR16","unstructured":"Wang, Y., Wang, Z.: Explicit Routing Algorithms for Internet Traffic Engineering. In: Proc. of ICCCN, pp. 582\u2013588 (1999)"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11428831_100","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,16]],"date-time":"2019-03-16T13:30:47Z","timestamp":1552743047000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11428831_100"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540260325","9783540321118"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11428831_100","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}