{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T09:07:47Z","timestamp":1781255267847,"version":"3.54.1"},"reference-count":12,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/iscc.2003.1214147","type":"proceedings-article","created":{"date-parts":[[2004,3,30]],"date-time":"2004-03-30T17:17:26Z","timestamp":1080667046000},"page":"365-372","source":"Crossref","is-referenced-by-count":19,"title":["On efficient max-min fair routing algorithms"],"prefix":"10.1109","author":[{"given":"M.","family":"Pioro","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"P.","family":"Nilsson","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"E.","family":"Kubilinskas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"G.","family":"Fodor","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"3","article-title":"Applicability statement for traffic engineering with mpls","author":"boyle","year":"0","journal-title":"IETF RFC 3346"},{"key":"2","author":"bertsekas","year":"1987","journal-title":"Data Networks"},{"key":"10","author":"pioro","year":"2002","journal-title":"A Note on Optimal Dual Variables in A PF\/MMF Robust Network Design Problem"},{"key":"1","author":"ahuja","year":"1993","journal-title":"Network Flows"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(92)90347-C"},{"key":"6","author":"lasdon","year":"1970","journal-title":"Optimization Theory for Large Systems"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/SFFCS.1999.814631"},{"key":"4","first-page":"2006","article-title":"Rate control for communication networks: Shadow prices, proportional fairness and stability","author":"kelly","year":"1997","journal-title":"Journal of the Operational Research Society 49"},{"key":"9","doi-asserted-by":"crossref","DOI":"10.1016\/S0377-2217(99)00240-4","article-title":"On the lexicographical minmax approach to location problems","volume":"122","author":"ogryczak","year":"2000","journal-title":"European Journal of Operational Research"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/ISCC.2002.1021717"},{"key":"11","author":"pioro","year":"2002","journal-title":"Some Useful Properties for the MMF Routing Optimization"},{"key":"12","article-title":"A polynomial algorithm for solving a general max-min fairness problem","author":"tomaszewski","year":"2002","journal-title":"Proceedings of the Second Polish-German Teletraffic Symposium (PGTS'2002)"}],"event":{"name":"ISCC 2003 - International Symposium on Computers and Communications","location":"Kemer-Antalya, Turkey","acronym":"ISCC-03"},"container-title":["Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8616\/27298\/01214147.pdf?arnumber=1214147","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T00:34:58Z","timestamp":1497573298000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1214147\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/iscc.2003.1214147","relation":{},"subject":[]}}