{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T22:37:18Z","timestamp":1773873438737,"version":"3.50.1"},"reference-count":15,"publisher":"Elsevier BV","issue":"1-4","license":[{"start":{"date-parts":[[2002,5,1]],"date-time":"2002-05-01T00:00:00Z","timestamp":1020211200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Performance Evaluation"],"published-print":{"date-parts":[[2002,5]]},"DOI":"10.1016\/s0166-5316(02)00036-6","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T19:55:37Z","timestamp":1034625337000},"page":"201-223","source":"Crossref","is-referenced-by-count":74,"title":["On open shortest path first related network optimisation problems"],"prefix":"10.1016","volume":"48","author":[{"given":"M.","family":"Pi\u00f3ro","sequence":"first","affiliation":[]},{"given":"\u00c1.","family":"Szentesi","sequence":"additional","affiliation":[]},{"given":"J.","family":"Harmatos","sequence":"additional","affiliation":[]},{"given":"A.","family":"J\u00fcttner","sequence":"additional","affiliation":[]},{"given":"P.","family":"Gajowniczek","sequence":"additional","affiliation":[]},{"given":"S.","family":"Kozdrowski","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-5316(02)00036-6_BIB1","unstructured":"OSPF Version 2, RFC2328 (http:\/\/www.ietf.org\/rfc\/rfc2328.txt), 1998."},{"key":"10.1016\/S0166-5316(02)00036-6_BIB2","doi-asserted-by":"crossref","unstructured":"B. Fortz, M. Thorup, Internet traffic engineering by optimizing OSPF weights, in: Proceedings of the INFOCOM\u20192000, Tel Aviv, 2000.","DOI":"10.1109\/INFCOM.2000.832225"},{"key":"10.1016\/S0166-5316(02)00036-6_BIB3","unstructured":"W. Ben Ameur, E. Gourdin, B. Liau, Dimensioning of internet networks, in: Proceedings of the DRCN\u20192000, Munich, 2000."},{"key":"10.1016\/S0166-5316(02)00036-6_BIB4","unstructured":"A. Farag\u00f3, B. Szviatovszki, \u00c1. Szentesi, Allocation of administrative weights in PNNI, in: Proceedings of the NETWORKS\u201998, Sorrento, 1998."},{"key":"10.1016\/S0166-5316(02)00036-6_BIB5","unstructured":"M.R. Garey, D.S. Johnson, Computers and Intractability\u2014A Guide to the Theory of NP-Completeness, Freeman, New York, 1979."},{"key":"10.1016\/S0166-5316(02)00036-6_BIB6","unstructured":"A. Tomaszewski, August 2000, Private communication."},{"key":"10.1016\/S0166-5316(02)00036-6_BIB7","unstructured":"ILOG CPLEX 6.5 Reference Manual, ILOG S.A., 1999."},{"key":"10.1016\/S0166-5316(02)00036-6_BIB8","doi-asserted-by":"crossref","unstructured":"D.S. Johnson, C.R. Aragon, L.A. McGeoch, C. Schevon, Optimization by simulated annealing: an experimental evaluation, Oper. Res. 39 (1) (May\u2013June 1991).","DOI":"10.1287\/opre.39.3.378"},{"key":"10.1016\/S0166-5316(02)00036-6_BIB9","unstructured":"M. Pi\u00f3ro, T. Stidsen, A. Glenstrup, C. Fenger, H. Christiansen, Design of robust optical networks, in: Proceedings of the NETWORKS\u20192000, Toronto, 2000."},{"key":"10.1016\/S0166-5316(02)00036-6_BIB10","unstructured":"L.S. Lasdon, Optimization Theory for Large Systems, Macmillan, New York, 1970."},{"key":"10.1016\/S0166-5316(02)00036-6_BIB11","doi-asserted-by":"crossref","unstructured":"M. Held, P. Wolfe, H. Crowder, Validation of subgradient optimization, Math. Program. 6 (1974).","DOI":"10.1007\/BF01580223"},{"key":"10.1016\/S0166-5316(02)00036-6_BIB12","unstructured":"Z. Michalewicz, Genetic Algorithms+DataStructures=Evolution Programs, Springer, Berlin, 1966."},{"key":"10.1016\/S0166-5316(02)00036-6_BIB13","unstructured":"S. Kozdrowski, M. Pi\u00f3ro, J. Arabas, M. Szcze\u015bniak, Robust design of multicommodity integral flow networks, in: Proceedings of the Seventh International Conference on Genetic Algorithms ICGA\u201997, University of Michigan, East Lansing, 1997."},{"key":"10.1016\/S0166-5316(02)00036-6_BIB14","doi-asserted-by":"crossref","unstructured":"D. Medhi, D. Tipper, Some approaches to solving a multi-hour broadband network capacity design problem with single-path routing, Telecommun. Systems 13 (2000) 269\u2013271.","DOI":"10.1023\/A:1019148207669"},{"key":"10.1016\/S0166-5316(02)00036-6_BIB15","doi-asserted-by":"crossref","unstructured":"M. Pi\u00f3ro, P. Gajowniczek, Solving multicommodity integral flow problems by simulated allocation, Telecommun. Systems 7 (1\u20133) (1997) 17\u201328.","DOI":"10.1023\/A:1019151707785"}],"container-title":["Performance Evaluation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166531602000366?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166531602000366?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,7]],"date-time":"2020-01-07T17:44:19Z","timestamp":1578419059000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166531602000366"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,5]]},"references-count":15,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2002,5]]}},"alternative-id":["S0166531602000366"],"URL":"https:\/\/doi.org\/10.1016\/s0166-5316(02)00036-6","relation":{},"ISSN":["0166-5316"],"issn-type":[{"value":"0166-5316","type":"print"}],"subject":[],"published":{"date-parts":[[2002,5]]}}}