{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:18:56Z","timestamp":1740140336198,"version":"3.37.3"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,10,30]],"date-time":"2018-10-30T00:00:00Z","timestamp":1540857600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Manag Sci"],"published-print":{"date-parts":[[2020,1]]},"DOI":"10.1007\/s10287-018-0336-7","type":"journal-article","created":{"date-parts":[[2018,10,30]],"date-time":"2018-10-30T01:54:58Z","timestamp":1540864498000},"page":"65-77","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["An approximation to max min fairness in multi commodity networks"],"prefix":"10.1007","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1357-0454","authenticated-orcid":false,"given":"Hamoud S.","family":"Bin Obaid","sequence":"first","affiliation":[]},{"given":"Theodore B.","family":"Trafalis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,10,30]]},"reference":[{"key":"336_CR1","unstructured":"Bashllari A, Nace D, Gourdin E, Klopfenstein O (2007) The MMF rerouting computation problem, pp 1\u20136"},{"key":"336_CR2","volume-title":"Data networks","author":"D Bertsekas","year":"1992","unstructured":"Bertsekas D, Hall P (1992) Data networks. Prentice-Hall, Engelwood Cliffs"},{"issue":"5","key":"336_CR3","doi-asserted-by":"publisher","first-page":"1073","DOI":"10.1109\/TNET.2007.896231","volume":"15","author":"J Boudec Le","year":"2007","unstructured":"Le Boudec J (2007) A unified framework for max\u2013min and min\u2013max fairness with applications. IEEE\/ACM Trans Netw 15(5):1073\u20131083","journal-title":"IEEE\/ACM Trans Netw"},{"key":"336_CR4","doi-asserted-by":"crossref","unstructured":"Carvalho R, Buzna L, Just W, Helbing D, Arrowsmith DK (2012) Fair sharing of resources in a supply network with constraints. Phys Rev E Stat Nonlinear Soft Matter Phys 85(4): Article ID046101","DOI":"10.1103\/PhysRevE.85.046101"},{"key":"336_CR5","first-page":"1","volume":"11","author":"E Cohen","year":"1991","unstructured":"Cohen E, Megiddo N (1991) Algorithms and complexity analysis for some flow problems. Algorithmica 11:1\u201321","journal-title":"Algorithmica"},{"key":"336_CR6","first-page":"1","volume-title":"Maximum throughput network routing subject to fair flow allocation","author":"S Coniglio","year":"2014","unstructured":"Coniglio S (2014) Maximum throughput network routing subject to fair flow allocation, vol 8596. Springer, Berlin, pp 1\u201312"},{"key":"336_CR7","first-page":"846","volume":"14","author":"E Danna","year":"2012","unstructured":"Danna E, Mandal S, Singh A (2012) A practical algorithm for balancing the max\u2013min fairness and throughput objectives in traffic engineering. Proc IEEE INFOCOM 14:846\u2013854","journal-title":"Proc IEEE INFOCOM"},{"key":"336_CR8","volume-title":"Finance against poverty","author":"D Hulme","year":"1996","unstructured":"Hulme D, Mosley P (1996) Finance against poverty, vol 2. Psychology Press, London"},{"key":"336_CR9","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-1-4614-0806-2_4","volume-title":"Modeling equity for allocating public resources. Community-based operations research","author":"PD Leclerc","year":"2012","unstructured":"Leclerc PD, McLay LA, Mayorga ME (2012) Modeling equity for allocating public resources. Community-based operations research. Springer, New York, pp 97\u2013118"},{"key":"336_CR10","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF01585506","volume":"7","author":"N Megiddo","year":"1974","unstructured":"Megiddo N (1974) Optimal flows in networks with multiple sources and sinks. Math Program 7:97\u2013107","journal-title":"Math Program"},{"issue":"4","key":"336_CR11","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1109\/SURV.2008.080403","volume":"10","author":"D Nace","year":"2008","unstructured":"Nace D, Pi M (2008) Max\u2013min fairness and its applications to routing and load-balancing in communication networks: a tutorial. IEEE Commun Surv Tutor 10(4):5\u201317","journal-title":"IEEE Commun Surv Tutor"},{"issue":"2","key":"336_CR12","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1016\/j.cor.2006.03.020","volume":"35","author":"D Nace","year":"2006","unstructured":"Nace D, Doan LN, Klopfenstein O, Bashllari A (2006) Max\u2013min fairness in multi-commodity flows. Comput Oper Res 35(2):557\u2013573","journal-title":"Comput Oper Res"},{"issue":"3","key":"336_CR13","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1002\/net.20371","volume":"55","author":"S Orlowski","year":"2010","unstructured":"Orlowski S, Wess\u00e4ly R, Pi\u00f3ro M, Tomaszewski A (2010) SNDlib 1.0\u2014survivable network design library. Networks 55(3):276\u2013286","journal-title":"Networks"},{"key":"336_CR14","doi-asserted-by":"crossref","unstructured":"R\u00e9tv\u00e1ri G, B\u00edr\u00f3 JJ, Cinkler T (2007) Fairness in capacitated networks: a polyhedral approach. In: IEEE INFOCOM (2016). http:\/\/doi.org\/10.1109\/INFCOM.2007.188","DOI":"10.1109\/INFCOM.2007.188"}],"container-title":["Computational Management Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-018-0336-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10287-018-0336-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-018-0336-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T21:42:43Z","timestamp":1720734163000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10287-018-0336-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,30]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,1]]}},"alternative-id":["336"],"URL":"https:\/\/doi.org\/10.1007\/s10287-018-0336-7","relation":{},"ISSN":["1619-697X","1619-6988"],"issn-type":[{"type":"print","value":"1619-697X"},{"type":"electronic","value":"1619-6988"}],"subject":[],"published":{"date-parts":[[2018,10,30]]},"assertion":[{"value":"2 June 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 October 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 October 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}