{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T18:43:51Z","timestamp":1768416231921,"version":"3.49.0"},"reference-count":27,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2005,11,1]],"date-time":"2005-11-01T00:00:00Z","timestamp":1130803200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Netw. Serv. Manage."],"published-print":{"date-parts":[[2005,11]]},"DOI":"10.1109\/tnsm.2005.4798297","type":"journal-article","created":{"date-parts":[[2009,3,9]],"date-time":"2009-03-09T22:57:20Z","timestamp":1236639440000},"page":"9-18","source":"Crossref","is-referenced-by-count":30,"title":["Determining link weight system under various objectives for OSPF networks using a Lagrangian relaxation-based approach"],"prefix":"10.1109","volume":"2","author":[{"given":"Shekhar","family":"Srivastava","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gaurav","family":"Agrawal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michal","family":"Pioro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Deep","family":"Medhi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref19s","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-5316(02)00036-6"},{"key":"ref22s","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2003.1208953"},{"key":"ref20s","doi-asserted-by":"publisher","DOI":"10.1002\/bltj.2267"},{"key":"ref17s","author":"moy","year":"1999","journal-title":"OSPF Anatomy of an Internet Routing Protocol"},{"key":"ref7s","doi-asserted-by":"publisher","DOI":"10.1109\/90.929850"},{"key":"ref10s","doi-asserted-by":"publisher","DOI":"10.1080\/05695557808975181"},{"key":"ref13s","doi-asserted-by":"publisher","DOI":"10.1023\/A:1019148207669"},{"key":"ref15s","author":"minoux","year":"1986","journal-title":"Mathematical Programming Theory and Algorithms"},{"key":"ref5s","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.10.1.1"},{"key":"ref9s","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BFb0120690","article-title":"Lagrangean Relaxation for Integer Programming","volume":"2","author":"geoffrion","year":"1974","journal-title":"Mathematical Programming Study"},{"key":"ref3s","year":"0"},{"key":"ref23s","doi-asserted-by":"publisher","DOI":"10.1016\/S1388-3437(03)80191-9"},{"key":"ref1s","article-title":"Optimal Shortest path routing for Internet networks","author":"bouruia","year":"0","journal-title":"Proceedings of International Network Optimization Conference (INOC) 2003"},{"key":"ref21s","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.810317"},{"key":"ref18s","author":"pioro","year":"2004","journal-title":"Routing Flow and Capacity Design in Communication and Computer Networks"},{"key":"ref16s","author":"moy","year":"1998","journal-title":"Internet Engineering Task Force"},{"key":"ref11s","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2001.965851"},{"key":"ref14s","author":"medina","year":"2001","journal-title":"BRITE Universal Topology Generation From A User's Perspective"},{"key":"ref3","article-title":"A Lagrangian Approach for Integrated Network Design and Routing in IP Networks","author":"bley","year":"2003","journal-title":"Proceedings of International Network Optimization Conference (INOC)"},{"key":"ref4s","year":"0"},{"key":"ref8s","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2000.832225"},{"key":"ref6s","doi-asserted-by":"publisher","DOI":"10.1023\/A:1014852026591"},{"key":"ref2","author":"bertsekas","year":"1992","journal-title":"Data Networks 2nd Edition"},{"key":"ref1","author":"ahuja","year":"1993","journal-title":"Network Flows Theory Algorithms and Applications"},{"key":"ref12s","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580223"},{"key":"ref2s","author":"callon","year":"1990","journal-title":"Internet Engineering Task Force"},{"key":"ref24s","year":"0"}],"container-title":["IEEE Transactions on Network and Service Management"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4275028\/4798295\/04798297.pdf?arnumber=4798297","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:52:31Z","timestamp":1638219151000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4798297\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,11]]},"references-count":27,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tnsm.2005.4798297","relation":{},"ISSN":["1932-4537"],"issn-type":[{"value":"1932-4537","type":"print"}],"subject":[],"published":{"date-parts":[[2005,11]]}}}