{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:41:52Z","timestamp":1750308112694,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":12,"publisher":"ACM","license":[{"start":{"date-parts":[[2005,3,13]],"date-time":"2005-03-13T00:00:00Z","timestamp":1110672000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2005,3,13]]},"DOI":"10.1145\/1066677.1066763","type":"proceedings-article","created":{"date-parts":[[2005,8,3]],"date-time":"2005-08-03T08:31:47Z","timestamp":1123057907000},"page":"366-370","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["A branch-price-and-propagate approach for optimizing IGP weight setting subject to unique shortest paths"],"prefix":"10.1145","author":[{"given":"Farid","family":"Ajili","sequence":"first","affiliation":[{"name":"Imperial College London, London, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Rodo\u0161ek","sequence":"additional","affiliation":[{"name":"Imperial College London, London, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Eremin","sequence":"additional","affiliation":[{"name":"Imperial College London, London, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2005,3,13]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Network flows: theory, algorithms and applications","author":"Ahuja R.","year":"1993","unstructured":"R. Ahuja , T. Magnanti , and J. Orlin . Network flows: theory, algorithms and applications . Prentice-Hall , 1993 . R. Ahuja, T. Magnanti, and J. Orlin. Network flows: theory, algorithms and applications. Prentice-Hall, 1993."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.48.2.318.12378"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480100377428"},{"key":"e_1_3_2_1_4_1","volume-title":"RIP, OSPF, BGP, PNNI and Cisco routing protocols","author":"Black U.","year":"2000","unstructured":"U. Black . IP Routing Protocols , RIP, OSPF, BGP, PNNI and Cisco routing protocols . Prentice-Hall , 2000 . U. Black. IP Routing Protocols, RIP, OSPF, BGP, PNNI and Cisco routing protocols. Prentice-Hall, 2000."},{"key":"e_1_3_2_1_6_1","volume-title":"MPLS: Technology and Applications","author":"Davie B.","year":"2000","unstructured":"B. Davie and Y. Rekhter . MPLS: Technology and Applications . Morgan Kaufmann Publishers , 2000 . B. Davie and Y. Rekhter. MPLS: Technology and Applications. Morgan Kaufmann Publishers, 2000."},{"key":"e_1_3_2_1_7_1","volume-title":"A genetic algorithm for the weight setting problem in OSPF routing. Journal of combinatorial optimization, 6(3):299--333","author":"Ericsson M.","year":"2002","unstructured":"M. Ericsson , M. Resende , and P. Pardalos . A genetic algorithm for the weight setting problem in OSPF routing. Journal of combinatorial optimization, 6(3):299--333 , 2002 . M. Ericsson, M. Resende, and P. Pardalos. A genetic algorithm for the weight setting problem in OSPF routing. Journal of combinatorial optimization, 6(3):299--333, 2002."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2002.1039866"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2000.832225"},{"key":"e_1_3_2_1_10_1","unstructured":"IC-PARC. ECLiPSe 5.7 User Manual 2003. http:\/\/www.icparc.ic.ac.uk\/eclipse.  IC-PARC. ECLiPSe 5.7 User Manual 2003. http:\/\/www.icparc.ic.ac.uk\/eclipse."},{"key":"e_1_3_2_1_11_1","volume-title":"Constraint and Integer Programming: Toward a Unified Methodology","author":"Milano M.","year":"2003","unstructured":"M. Milano , editor. Constraint and Integer Programming: Toward a Unified Methodology . Kluwer Academic Publishers , 2003 . M. Milano, editor. Constraint and Integer Programming: Toward a Unified Methodology. Kluwer Academic Publishers, 2003."},{"key":"e_1_3_2_1_12_1","volume-title":"Pearson Higher Education","author":"Osborne E.","year":"2002","unstructured":"E. Osborne and A. Simha . Traffic engineering with MPLS . Pearson Higher Education , 2002 . E. Osborne and A. Simha. Traffic engineering with MPLS. Pearson Higher Education, 2002."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.v43:3"}],"event":{"name":"SAC05: The 2005 ACM Symposium on Applied Computing","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"],"location":"Santa Fe New Mexico","acronym":"SAC05"},"container-title":["Proceedings of the 2005 ACM symposium on Applied computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1066677.1066763","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1066677.1066763","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:08:13Z","timestamp":1750262893000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1066677.1066763"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,3,13]]},"references-count":12,"alternative-id":["10.1145\/1066677.1066763","10.1145\/1066677"],"URL":"https:\/\/doi.org\/10.1145\/1066677.1066763","relation":{},"subject":[],"published":{"date-parts":[[2005,3,13]]},"assertion":[{"value":"2005-03-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}