{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,19]],"date-time":"2025-10-19T15:26:18Z","timestamp":1760887578556},"reference-count":12,"publisher":"IEEE","license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1109\/iscc.2004.1358664","type":"proceedings-article","created":{"date-parts":[[2004,11,30]],"date-time":"2004-11-30T19:56:05Z","timestamp":1101844565000},"page":"957-962 Vol.2","source":"Crossref","is-referenced-by-count":5,"title":["A novel Lagrangian-relaxation to the minimum cost multicommodity flow problem and its application to OSPF traffic engineering"],"prefix":"10.1109","author":[{"given":"G.","family":"Retvdri","sequence":"first","affiliation":[{"name":"Dept. of Telecommun. & Media Informatics, Budapest Univ. of Technol. & Econ., Hungary"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.J.","family":"Biro","sequence":"additional","affiliation":[{"name":"Dept. of Telecommun. & Media Informatics, Budapest Univ. of Technol. & Econ., Hungary"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"Cinkler","sequence":"additional","affiliation":[{"name":"Dept. of Telecommun. & Media Informatics, Budapest Univ. of Technol. & Econ., Hungary"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","first-page":"115","article-title":"Lagrangian relaxation","author":"lemarechal","year":"2001","journal-title":"Computational Combinatorial Optimization"},{"article-title":"Linear Programming and Network Flows","year":"1990","author":"bazaraa","key":"ref3"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(78)90078-X"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2002.1039866"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/76359.76368"},{"key":"ref5","article-title":"OSPF Version 2","author":"moy","year":"1998","journal-title":"RFC 2328"},{"key":"ref12","article-title":"On the representability of arbitrary path sets as shortest paths: Theory, algorithms and complexity","author":"r\u00e9tv\u00e1ri and","year":"2004","journal-title":"Proc IFIP\/TC6 Networking"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2003.1208953"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2002.1003042"},{"article-title":"Network Flows: Theory. Algorithms. and Applications","year":"1993","author":"ahuja","key":"ref2"},{"key":"ref9","article-title":"Internet traffic engineering without full-mesh overlaying","author":"wang","year":"2001","journal-title":"Proceedings of INFOCOM 2001"},{"journal-title":"The GLPK project","year":"0","key":"ref1"}],"event":{"name":"Proceedings. ISCC 2004. Ninth International Symposium on Computers And Communications","start":{"date-parts":[[2004,7,28]]},"location":"Alexandria, Egypt","end":{"date-parts":[[2004,7,1]]}},"container-title":["Proceedings. ISCC 2004. Ninth International Symposium on Computers And Communications (IEEE Cat. No.04TH8769)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9388\/29799\/01358664.pdf?arnumber=1358664","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,8]],"date-time":"2024-03-08T18:46:57Z","timestamp":1709923617000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1358664\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/iscc.2004.1358664","relation":{},"subject":[],"published":{"date-parts":[[2004]]}}}