{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:36:22Z","timestamp":1761597382224},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,10,31]],"date-time":"2012-10-31T00:00:00Z","timestamp":1351641600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Evol. Intel."],"published-print":{"date-parts":[[2012,12]]},"DOI":"10.1007\/s12065-012-0084-5","type":"journal-article","created":{"date-parts":[[2012,10,30]],"date-time":"2012-10-30T04:58:07Z","timestamp":1351573087000},"page":"231-244","source":"Crossref","is-referenced-by-count":6,"title":["Meta-heuristic approach to proportional fairness"],"prefix":"10.1007","volume":"5","author":[{"given":"Mario","family":"K\u00f6ppen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaori","family":"Yoshida","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kei","family":"Ohnishi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masato","family":"Tsuru","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,10,31]]},"reference":[{"key":"84_CR1","volume-title":"Data networks","author":"D Bertsekas","year":"1992","unstructured":"Bertsekas D, Gallager R (1992) Data networks. Prentice Hall, Englewood Cliffs"},{"key":"84_CR2","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1002\/ett.4460080106","volume":"8","author":"F Kelly","year":"1997","unstructured":"Kelly F (1997) Charging and rate control for elastic traffic. Eur Trans Telecommun 8:33\u201337","journal-title":"Eur Trans Telecommun"},{"issue":"5","key":"84_CR3","doi-asserted-by":"crossref","first-page":"1402","DOI":"10.1109\/TSMCB.2008.926329","volume":"38","author":"X Zou","year":"2008","unstructured":"Zou X, Chen Y, Liu M, Kang L (2008) A new evolutionary algorithm for solving many-objective optimization problems. IEEE Trans Syst Man Cybern Part B Cybern 38(5):1402\u20131412","journal-title":"IEEE Trans Syst Man Cybern Part B Cybern"},{"issue":"1","key":"84_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2307\/2311357","volume":"68","author":"L Dubins","year":"1961","unstructured":"Dubins L, Spanier E (1961) How to cut a cake fairly? Am Math Mon 68(1):1\u201317","journal-title":"Am Math Mon"},{"issue":"1","key":"84_CR5","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s10479-007-0234-9","volume":"167","author":"W Ogryczak","year":"2009","unstructured":"Ogryczak W (2009) Inequality measures and equitable locations. Ann Oper Res 167(1):61\u201386","journal-title":"Ann Oper Res"},{"issue":"1","key":"84_CR6","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1145\/122140.122141","volume":"25","author":"S Haldar","year":"1991","unstructured":"Haldar S, Subramanian DK (1991) Fairness in processor scheduling in time sharing systems. SIGOPS Oper Syst Rev 25(1):4\u201318","journal-title":"SIGOPS Oper Syst Rev"},{"issue":"4","key":"84_CR7","doi-asserted-by":"crossref","first-page":"263","DOI":"10.4169\/amer.math.monthly.119.04.263","volume":"119","author":"RW Hall","year":"2012","unstructured":"Hall RW, Tymoczko D (2012) Submajorization and the geometry of unordered collections. Am Math Mon 119(4):263\u2013283","journal-title":"Am Math Mon"},{"issue":"10","key":"84_CR8","doi-asserted-by":"crossref","first-page":"1209","DOI":"10.1016\/S0967-0661(03)00055-8","volume":"11","author":"M Baglietto","year":"2003","unstructured":"Baglietto M, Bolla R, Davoli F, Marchese M, Mongelli M (2003) Integration of pricing models between best-effort and guaranteed performance services in telecommunication networks. Control Eng Pract 11(10):1209\u20131226","journal-title":"Control Eng Pract"},{"key":"84_CR9","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/s11134-006-7587-7","volume":"53","author":"T Bonald","year":"2006","unstructured":"Bonald T, Massouli\u00e9 L, Prouti\u00e8re A, Virtamo J (2006) A queueing analysis of max\u2013min fairness, proportional fairness and balanced fairness. Queue Syst 53:65\u201384","journal-title":"Queue Syst"},{"issue":"5","key":"84_CR10","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1016\/j.peva.2009.12.002","volume":"67","author":"B Tan","year":"2010","unstructured":"Tan B, Ying L, Srikant R (2010) Short-term fairness and long-term QoS in the internet. Perform Eval 67(5):406\u2013414","journal-title":"Perform Eval"},{"issue":"15","key":"84_CR11","doi-asserted-by":"crossref","first-page":"2947","DOI":"10.1016\/j.comnet.2008.06.013","volume":"52","author":"T Harks","year":"2008","unstructured":"Harks T, Poschwatta T. (2008) Congestion control in utility fair networks. Comput Netw 52(15):2947\u20132960","journal-title":"Comput Netw"},{"key":"84_CR12","doi-asserted-by":"crossref","unstructured":"Zhou H, Fan P, Li J (2009) Cooperative proportional fairness scheduling for wireless transmissions. In: Proceedings of the international conference on wireless communications and mobile computing: connecting the world wirelessly 2009 (ser. IWCMC \u201809). ACM, pp 12\u201316","DOI":"10.1145\/1582379.1582383"},{"issue":"5","key":"84_CR13","doi-asserted-by":"crossref","first-page":"1453","DOI":"10.1109\/TNET.2009.2026645","volume":"17","author":"H Boche","year":"2009","unstructured":"Boche H, Schubert M (2009) Nash bargaining and proportional fairness for wireless systems. IEEE\/ACM Trans Netw 17(5):1453\u20131466","journal-title":"IEEE\/ACM Trans Netw"},{"issue":"18","key":"84_CR14","doi-asserted-by":"crossref","first-page":"4009","DOI":"10.1016\/j.ins.2011.05.001","volume":"181","author":"M Uchida","year":"2011","unstructured":"Uchida M, Kurose J (2011) An information-theoretic characterization of weighted \u03b1-proportional fairness in network resource allocation. Inf Sci 181(18):4009\u20134023","journal-title":"Inf Sci"},{"key":"84_CR15","volume-title":"Collective choice and social welfare","author":"AK Sen","year":"1970","unstructured":"Sen AK (1970) Collective choice and social welfare. Holden-Day, San Francisco"},{"key":"84_CR16","volume-title":"Rational choice, collective decisions, and social welfare","author":"K Suzumura","year":"2009","unstructured":"Suzumura K (2009) Rational choice, collective decisions, and social welfare. Cambridge University Press, Cambridge"},{"key":"84_CR17","first-page":"34","volume":"3","author":"W Ogryczak","year":"2003","unstructured":"Ogryczak W, \u015aliwi\u0144ski T, Wierzbicki A (2003) Fair resource allocation schemes and network dimensioning problems. J Telecommun Inf Technol 3:34\u201342","journal-title":"J Telecommun Inf Technol"},{"key":"84_CR18","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1016\/j.omega.2005.12.005","volume":"36","author":"W Ogryczak","year":"2008","unstructured":"Ogryczak W, Wierzbicki A, Milewski M (2008) A multi-criteria approach to fair and efficient bandwidth allocation. Omega 36:451\u2013463","journal-title":"Omega"},{"issue":"1","key":"84_CR19","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1006\/jcss.2001.1752","volume":"63","author":"J Kleinberg","year":"2001","unstructured":"Kleinberg J, Rabani Y, Tardos E (2001) Fairness in routing and load balancing. J Comput Syst Sci 63(1):2\u201321","journal-title":"J Comput Syst Sci"},{"key":"84_CR20","unstructured":"Zitzler E, Laumanns M, Thiele L (2002) SPEA2: improving the strength pareto evolutionary algorithm. In: Giannakoglou K, Tsahalis D, Periaux J, Papailou P, Fogarty T (eds) EUROGEN 2001, evolutionary methods for design, optimization and control with applications to industrial problems, Athens, Greece, pp 95\u2013100"},{"issue":"3","key":"84_CR21","first-page":"287","volume":"2","author":"M Reyes-Sierra","year":"2006","unstructured":"Reyes-Sierra M, Coello CAC (2006) Multi-objective particle swarm optimizers: a survey of the state-of-the-art. Int J Comput Intell Res 2(3):287\u2013308","journal-title":"Int J Comput Intell Res"},{"key":"84_CR22","doi-asserted-by":"crossref","unstructured":"Knowles J, Corne D (2007) Quantifying the effects of objective space dimension in evolutionary multiobjective optimization. In: Evolutionary multi-criterion optimization, ser. LNCS 4403. Springer, Matsushima, pp 757\u2013771","DOI":"10.1007\/978-3-540-70928-2_57"},{"key":"84_CR23","doi-asserted-by":"crossref","unstructured":"K\u00f6ppen M, Yoshida K, Tsuru M (2011) Unsorting the proportional fairness relation. In: Proceedings of the third international conference on intelligent networking and collaborative systems (INCoS 2011), Fukuoka, Japan, pp 47\u201352","DOI":"10.1109\/INCoS.2011.159"},{"key":"84_CR24","doi-asserted-by":"crossref","unstructured":"K\u00f6ppen M, Yoshida K, Tsuru M, Oie Y (2009) Fairness-based global optimization of user-centric networks. In: Fifth international joint conference on INC, IMS and IDC, 2009. NCM \u201909. IEEE, pp 441\u2013443","DOI":"10.1109\/NCM.2009.219"},{"key":"84_CR25","doi-asserted-by":"crossref","unstructured":"K\u00f6ppen M, Verschae R, Yoshida K, Tsuru M (2010) Comparison of evolutionary multi-objective optimization algorithms for the utilization of fairness in network control. In: Proceedings of the 2010 IEEE international conference on systems, man, and cybernetics (SMC 2010), Istanbul, Turkey, pp 2647\u20132655","DOI":"10.1109\/ICSMC.2010.5641898"},{"issue":"5","key":"84_CR26","doi-asserted-by":"crossref","first-page":"1085","DOI":"10.1109\/JSAC.2006.872890","volume":"24","author":"J Sun","year":"2006","unstructured":"Sun J, Modiano E, Zheng L (2006) Wireless channel allocation using an auction algorithm. IEEE J Sel Areas Commun 24(5):1085\u20131096","journal-title":"IEEE J Sel Areas Commun"},{"key":"84_CR27","doi-asserted-by":"crossref","unstructured":"Jaffe J (1981) Bottleneck flow control. IEEE Trans Commun 29(7):954\u2013962","DOI":"10.1109\/TCOM.1981.1095081"},{"key":"84_CR28","doi-asserted-by":"crossref","unstructured":"K\u00f6ppen M, Yoshida K, Ohnishi K (2011) Meta-heuristic optimization reloaded. In: Proceedings of the third world congress on nature and biologically inspired computing (NaBIC2011). IEEE CS Press, Salamanca, pp 562\u2013568","DOI":"10.1109\/NaBIC.2011.6089650"}],"container-title":["Evolutionary Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-012-0084-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12065-012-0084-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-012-0084-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,5]],"date-time":"2019-07-05T02:49:01Z","timestamp":1562294941000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12065-012-0084-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,31]]},"references-count":28,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,12]]}},"alternative-id":["84"],"URL":"https:\/\/doi.org\/10.1007\/s12065-012-0084-5","relation":{},"ISSN":["1864-5909","1864-5917"],"issn-type":[{"value":"1864-5909","type":"print"},{"value":"1864-5917","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,10,31]]}}}