Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2014 (2014), Article ID 612018, 25 pages
http://dx.doi.org/10.1155/2014/612018
Review Article

Fair Optimization and Networks: A Survey

1Institute of Control and Computation Engineering, Warsaw University of Technology, 00-665 Warsaw, Poland
2Department of Industrial Engineering and Operations Research, Columbia University, New York, NY 10027, USA
3Department of Electrical and Information Technology, Lund University, 22100 Lund, Sweden
4Institute of Telecommunications, Warsaw University of Technology, 00-665 Warsaw, Poland
5Laboratoire Heudiasyc, Université de Technologie de Compiègne, 60203 Compiègne, France

Received 7 March 2014; Revised 3 August 2014; Accepted 6 August 2014; Published 3 September 2014

Academic Editor: Yuri N. Sotskov

Copyright © 2014 Wlodzimierz Ogryczak et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. T. Ibaraki and N. Katoh, Resource Allocation Problems: Algorithmic Approaches, MIT Press, Cambridge, Mass, USA, 1988. View at MathSciNet
  2. N. Katoh and T. Ibaraki, “Resource allocation problems,” in Handbook of Combinatorial Optimization, D.-Z. Du and P. M. Pardalos, Eds., pp. 159–260, Kluwer Academic, Dordrecht, The Netherlands, 1998. View at Google Scholar · View at MathSciNet
  3. A. P. Sage and C. D. Cuppan, “On the systems engineering and management of systems of systems and federations of systems,” Information, Knowledge, and System Management, vol. 2, pp. 325–345, 2001. View at Google Scholar
  4. L. Wang, L. Fang, and K. W. Hipel, “Fairness in resource allocation in a system of systems,” in Proceedings of the IEEE International Conference on System of Systems Engineering (SoSE '07), pp. 1–6, San Antonio, Tex, USA, April 2007. View at Publisher · View at Google Scholar · View at Scopus
  5. H. Luss, Equitable Resource Allocation: Models, Algorithms, and Applications, John Wiley & Sons, Hoboken, NJ, USA, 2012.
  6. R. Denda, A. Banchs, and W. Effelsberg, “The fairness challenge in computer networks,” in Quality of Future Internet Services, vol. 1922 of Lecture Notes in Computer Science, pp. 208–220, 2000. View at Publisher · View at Google Scholar
  7. M. Pióro and D. Medhi, Routing, Flow and Capacity Design in Communication and Computer Networks, Morgan Kaufmann, San Francisco, Calif, USA, 2004.
  8. A. D. Procaccia, “Cake cutting: not just child’s play,” Communications of the ACM, vol. 56, no. 7, pp. 78–87, 2013. View at Publisher · View at Google Scholar · View at Scopus
  9. W. Ogryczak, “Inequality measures and equitable approaches to location problems,” European Journal of Operational Research, vol. 122, no. 2, pp. 374–391, 2000. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  10. L. Wang, L. Fang, and K. W. Hipel, “Basin-wide cooperative water resources allocation,” European Journal of Operational Research, vol. 190, no. 3, pp. 798–817, 2008. View at Publisher · View at Google Scholar · View at Scopus
  11. J. Jaffe, “Bottleneck ow control,” IEEE Transactions on Communications, vol. 7, pp. 207–237, 1980. View at Google Scholar
  12. D. Bertsekas and R. Gallager, Data Networks, Prentice Hall, Englewood Cliffs, NJ, USA, 1987.
  13. W. Kubiak, Proportional Optimization and Fairness, Springer, New York, NY, USA, 2009. View at MathSciNet
  14. D. Bertsimas, G. Lulli, and A. Odoni, “An integer optimization approach to large-scale air traffic flow management,” Operations Research, vol. 59, no. 1, pp. 211–227, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  15. R. S. Klein and H. Luss, “Minimax resource allocation with tree structured substitutable resources,” Operations Research, vol. 39, pp. 285–295, 1991. View at Google Scholar
  16. R. S. Klein, H. Luss, and U. G. Rothblum, “Minimax resource allocation problems with resource-substitutions represented by graphs,” Operations Research, vol. 41, no. 5, pp. 959–971, 1993. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  17. J. Pang and C. S. Yu, “A min-max resource allocation problem with substitutions,” European Journal of Operational Research, vol. 41, no. 2, pp. 218–223, 1989. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  18. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications, Prentice Hall, Englewood Cliffs, NJ, USA, 1993.
  19. J. Malczewski and W. Ogryczak, “The multiple criteria location problem: 1. A generalized network model and the set of efficient solutions,” Environment & Planning A, vol. 27, no. 12, pp. 1931–1960, 1995. View at Publisher · View at Google Scholar · View at Scopus
  20. W. Ogryczak, K. Studziński, and K. Zorychta, “A solver for the multi-objective transshipment problem with facility location,” European Journal of Operational Research, vol. 43, no. 1, pp. 53–64, 1989. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  21. M. Köppen, “Relational optimization and its application: from bottleneck flow control to wireless channel allocation,” Informatica, vol. 24, no. 3, pp. 413–433, 2013. View at Google Scholar · View at MathSciNet
  22. W. Ogryczak, “Comments on properties of the minmax solutions in goal programming,” European Journal of Operational Research, vol. 132, no. 1, pp. 17–21, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  23. W. Ogryczak, “On goal programming formulations of the reference point method,” Journal of the Operational Research Society, vol. 52, no. 6, pp. 691–698, 2001. View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  24. W. Ogryczak, “Multicriteria models for fair resource allocation,” Control and Cybernetics, vol. 36, no. 2, pp. 303–332, 2007. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  25. J. Rawls, “Justice as fairness,” Philosophical Review, pp. 164–194, 1958. View at Google Scholar
  26. J. Rawls, The Theory of Justice, Harvard University Press, Cambridge, Mass, USA, 1971.
  27. M. Dresher, Games of Strategy: Theory and Applications, Prentice-Hall, Englewood Cliffs, NJ, USA, 1961. View at MathSciNet
  28. D. Schmeidler, “The nucleolus of a characteristic function game,” SIAM Journal on Applied Mathematics, vol. 17, pp. 1163–1170, 1969. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  29. J. A. M. Potters and S. H. Tijs, “The nucleolus of a matrix game and other nucleoli,” Mathematics of Operations Research, vol. 17, no. 1, pp. 164–174, 1992. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  30. J. R. Rice, “Tchebycheff approximation in a compact metric space,” Bulletin of the American Mathematical Society, vol. 68, pp. 405–410, 1962. View at Publisher · View at Google Scholar · View at MathSciNet
  31. H. Luss and D. R. Smith, “Resource allocation among competing activities: a lexicographic minimax approach,” Operations Research Letters, vol. 5, no. 5, pp. 227–231, 1986. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  32. F. A. Behringer, “A simplex based algorithm for the lexicographically extended linear maxmin problem,” European Journal of Operational Research, vol. 7, no. 3, pp. 274–283, 1981. View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  33. E. Marchi and J. A. Oviedo, “Lexicographic optimality in the multiple objective linear programming: the nucleolar solution,” European Journal of Operational Research, vol. 57, no. 3, pp. 355–359, 1992. View at Publisher · View at Google Scholar · View at Scopus
  34. J. Lesca and P. Perny, “LP solvable models for multiagent fair allocation problems,” in Proceedings of the 19th European Conference on Artificial Intelligence, vol. 215, pp. 393–398, IOS Press, Lisbon, Portugal, 2010. View at Publisher · View at Google Scholar · View at Scopus
  35. L. M. Betts, J. R. Brown, and H. Luss, “Minimax resource allocation problems with ordering constraints,” Naval Research Logistics, vol. 41, no. 6, pp. 719–738, 1994. View at Publisher · View at Google Scholar · View at MathSciNet
  36. J. H. King, “Allocation of scarce resources in manufacturing facilities,” AT&T Technical Journal, vol. 68, no. 3, pp. 103–113, 1989. View at Google Scholar
  37. R. S. Klein, H. Luss, and D. R. Smith, “A lexicographic minimax algorithm for multiperiod resource allocation,” Mathematical Programming, vol. 55, no. 2, pp. 213–234, 1992. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  38. R. S. Klein, H. Luss, and U. G. Rothblum, “Multiperiod allocation of substitutable resources,” European Journal of Operational Research, vol. 85, no. 3, pp. 488–503, 1995. View at Publisher · View at Google Scholar · View at Scopus
  39. Q. C. Nguyen and R. E. Stone, “A multiperiod minimax resource allocation problem with substitutable resources,” Management Science, vol. 39, pp. 964–974, 1993. View at Google Scholar
  40. R. E. Burkard and F. Rendl, “Lexicographic bottleneck problems,” Operations Research Letters, vol. 10, no. 5, pp. 303–308, 1991. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  41. F. Della Croce, V. T. Paschos, and A. Tsoukias, “An improved general procedure for lexicographic bottleneck problems,” Operations Research Letters, vol. 24, no. 4, pp. 187–194, 1999. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  42. W. Ogryczak, “On the lexicographic minimax approach to location problems,” European Journal of Operational Research, vol. 100, no. 3, pp. 566–585, 1997. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  43. H. Luss, “On equitable resource allocation problems: a lexicographic minimax approach,” Operations Research, vol. 47, no. 3, pp. 361–378, 1999. View at Publisher · View at Google Scholar · View at Scopus
  44. W. Ogryczak, M. Pioro, and A. Tomaszewski, “Telecommunications network design and max-min optimization problem,” Journal of Telecommunications and Information Technology, vol. 2005, no. 3, pp. 43–56, 2005. View at Google Scholar
  45. B. Radunović and J.-Y. Le Boudec, “A unified framework for max-min and min-max fairness with applications,” IEEE/ACM Transactions on Networking, vol. 15, no. 5, pp. 1073–1083, 2007. View at Publisher · View at Google Scholar · View at Scopus
  46. D. Nace and M. Pióro, “Max-min fairness and its applications to routing and load-balancing in communication networks: a tutorial,” IEEE Communications Surveys and Tutorials, vol. 10, no. 4, pp. 5–17, 2008. View at Publisher · View at Google Scholar · View at Scopus
  47. R. M. Salles and J. A. Barria, “Lexicographic maximin optimisation for fair bandwidth allocation in computer networks,” European Journal of Operational Research, vol. 185, no. 2, pp. 778–794, 2008. View at Publisher · View at Google Scholar · View at Scopus
  48. W. Ogryczak and T. Śliwiński, “On direct methods for lexicographic min-max optimization,” in Computational Science and Its Applications—ICCSA 2006, vol. 3982 of Lecture Notes in Computer Science, pp. 802–811, 2006. View at Publisher · View at Google Scholar
  49. H. Dalton, “The measurement of the inequality of income,” The Measurement of the Inequality of Income, vol. 30, pp. 348–361, 1920. View at Google Scholar
  50. A. C. Pigou, Wealth and Welfare, Macmillan, London, UK, 1912.
  51. J. Konow, “A positive theory of economic fairness,” Journal of Economic Behavior and Organization, vol. 31, no. 1, pp. 13–35, 1996. View at Publisher · View at Google Scholar · View at Scopus
  52. J. Konow, “Which is the fairest one of all? A positive analysis of justice theories,” Journal of Economic Literature, vol. 41, no. 4, pp. 1188–1239, 2003. View at Publisher · View at Google Scholar · View at Scopus
  53. S. J. Brams and A. D. Taylor, Fair Division: From Cake Cutting to Dispute Resolution, Cambridge University Press, New York, NY, USA, 1996. View at Publisher · View at Google Scholar · View at MathSciNet
  54. H. Steinhaus, “Sur la division pragmatique,” Econometrica, vol. 17, pp. 315–319, 1949. View at Publisher · View at Google Scholar · View at MathSciNet
  55. A. B. Atkinson, “On the measurement of inequality,” Journal of Economic Theory, vol. 2, pp. 244–263, 1970. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  56. M. Rothschild and J. E. Stiglitz, “Some further results on the measurement of inequality,” Journal of Economic Theory, vol. 6, no. 2, pp. 188–204, 1973. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  57. A. Sen, On Economic Inequality, Clarendon Press, Oxford, UK, 1973.
  58. M. T. Marsh and D. A. Schilling, “Equity measurement in facility location analysis: a review and framework,” European Journal of Operational Research, vol. 74, no. 1, pp. 1–17, 1994. View at Publisher · View at Google Scholar · View at Scopus
  59. M. C. López-de-los-Mozos and J. A. Mesa, “The sum of absolute differences on a network: algorithm and comparison with other equality measures,” INFOR Journal, vol. 41, no. 2, pp. 195–210, 2003. View at Google Scholar · View at Scopus
  60. J. A. Mesa, J. Puerto, and A. Tamir, “Improved algorithms for several network location problems with equality measures,” Discrete Applied Mathematics, vol. 130, no. 3, pp. 437–448, 2003. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  61. R. Jain, D. Chiu, and W. Hawe, “A quantitative measure of fairness and discrimination for resource allocation in shared computer system,” Tech. Rep., Eastern Research Laboratory, Digital Equipment Corp., 1984. View at Google Scholar
  62. T. Lan, D. Kao, M. Chiang, and A. Sabharwal, “An axiomatic theory of fairness in network resource allocation,” in Proceedings of the IEEE International Conference on Computer Communications (INFOCOM '10), pp. 1–9, IEEE, San Diego, Calif, USA, March 2010. View at Publisher · View at Google Scholar · View at Scopus
  63. M. M. Kostreva and W. Ogryczak, “Linear optimization with multiple equitable criteria,” RAIRO Operations Research, vol. 33, no. 3, pp. 275–297, 1999. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  64. M. M. Kostreva, W. Ogryczak, and A. Wierzbicki, “Equitable aggregations and multiple criteria analysis,” European Journal of Operational Research, vol. 158, no. 2, pp. 362–377, 2004. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  65. W. Ogryczak, “Fair optimization: methodological foundations of fairness in network resource allocation,” in Proceedings of the IEEE 38th Annual Computer Software and Applications Conference Workshops (COMPSACW '14), pp. 43–48, IEEE, 2014.
  66. A. W. Marshall and I. Olkin, Inequalities: Theory of Majorization and its Applications, vol. 143 of Mathematics in Science and Engineering, Academic Press, New York, NY, USA, 1979. View at MathSciNet
  67. F. P. Kelly, A. K. Maulloo, and D. Tan, “Rate control for communication networks: Shadow prices, proportional fairness and stability,” Journal of the Operational Research Society, vol. 49, no. 3, pp. 206–217, 1997. View at Google Scholar · View at Scopus
  68. M. Pióro, G. Malicsko, and G. Fodor, “Optimal link capacity dimensioning in proportionally fair networks,” in NETWORKING 2002: Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications, vol. 2345 of Lecture Notes in Computer Science, pp. 277–288, Springer, Berlin, Germany, 2002. View at Publisher · View at Google Scholar
  69. J. Nash, “The bargaining problem,” Econometrica, vol. 18, pp. 155–162, 1950. View at Google Scholar · View at MathSciNet
  70. J. Mo and J. Walrand, “Fair end-to-end window-based congestion control,” IEEE/ACM Transactions on Networking, vol. 8, no. 5, pp. 556–567, 2000. View at Publisher · View at Google Scholar · View at Scopus
  71. C. Y. Lee and H. K. Cho, “Discrete bandwidth allocation considering fairness and transmission load in multicast networks,” Computers and Operations Research, vol. 34, no. 3, pp. 884–899, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  72. C. Y. Lee, Y. P. Moon, and Y. J. Cho, “A lexicographically fair allocation of discrete bandwidth for multirate multicast traffics,” Computers & Operations Research, vol. 31, no. 14, pp. 2349–2363, 2004. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  73. D. Bertsimas, V. F. Farias, and N. Trichakis, “The price of fairness,” Operations Research, vol. 59, no. 1, pp. 17–31, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  74. D. Bertsimas, V. F. Farias, and N. Trichakis, “On the efficiency-fairness trade-off,” Management Science, vol. 58, no. 12, pp. 2234–2250, 2012. View at Publisher · View at Google Scholar · View at Scopus
  75. A. Tang, J. Wang, and S. H. Low, “Is fair allocation always inefficient,” in Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM '04), pp. 35–45, Hong Kong, China, 2004.
  76. H. P. Young, Equity in Theory and Practice, Princeton University Press, Princeton, NJ, USA, 1994.
  77. H. Moulin, Axioms of Cooperative Decision Making, Cambridge University Press, New York, NY, USA, 1988. View at Publisher · View at Google Scholar · View at MathSciNet
  78. R. R. Yager, “On ordered weighted averaging aggregation operators in multicriteria decisionmaking,” IEEE Transactions on Systems, Man, and Cybernetics, vol. 18, no. 1, pp. 183–190, 1988. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  79. R. R. Yager and D. P. Filev, Essentials of Fuzzy Modeling and Control, Wiley, New York, NY, USA, 1994.
  80. M. Köppen, K. Yoshida, R. Verschae, M. Tsuru, and Y. Oie, “Comparative study on meta-heuristics for achieving parabolic fairness in wireless channel allocation,” in Proceedings of the IEEE/IPSJ 12th International Symposium on Applications and the Internet (SAINT ’12), pp. 302–307, IEEE, July 2012. View at Publisher · View at Google Scholar · View at Scopus
  81. R. R. Yager, “On the analytic representation of the Leximin ordering and its application to flexible constraint propagation,” European Journal of Operational Research, vol. 102, no. 1, pp. 176–192, 1997. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  82. M. Majdan and W. Ogryczak, “Determining OWA operator weights by mean absolute deviation minimization,” in Artificial Intelligence and Soft Computing, vol. 7267 of Lecture Notes in Computer Science, pp. 283–291, Springer, 2012. View at Publisher · View at Google Scholar
  83. Z. Xu, “An overview of methods for determining OWA weights,” International Journal of Intelligent Systems, vol. 20, no. 8, pp. 843–865, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  84. W. Ogryczak, “Tail mean and related robust solution concepts,” International Journal of Systems Science: Principles and Applications of Systems and Integration, vol. 45, no. 1, pp. 29–38, 2014. View at Publisher · View at Google Scholar · View at MathSciNet
  85. W. Ogryczak and A. Tamir, “Minimizing the sum of the k largest functions in linear time,” Information Processing Letters, vol. 85, no. 3, pp. 117–122, 2003. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  86. W. Ogryczak and T. Śliwiński, “On solving linear programs with the ordered weighted averaging objective,” European Journal of Operational Research, vol. 148, no. 1, pp. 80–91, 2003. View at Google Scholar · View at MathSciNet · View at Scopus
  87. R. R. Yager, “Constrained OWA aggregation,” Fuzzy Sets and Systems, vol. 81, no. 1, pp. 89–101, 1996. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  88. W. Ogryczak and A. Ruszczynski, “Dual stochastic dominance and related mean-risk models,” SIAM Journal on Optimization, vol. 13, no. 1, pp. 60–78, 2002. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  89. A. M{\"u}ller and D. Stoyan, Comparison Methods for Stochastic Models and Risks, John Wiley & Sons, Chichester, UK, 2002. View at MathSciNet
  90. H. Luss, “An algorithm for separable nonlinear minimax problems,” Operations Research Letters, vol. 6, no. 4, pp. 159–162, 1987. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  91. H. Luss, “A nonlinear minimax allocation problem with multiple knapsack constraints,” Operations Research Letters, vol. 10, no. 4, pp. 183–187, 1991. View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  92. A. Tomaszewski, “A polynomial algorithm for solving a general max-min fairness problem,” European Transactions on Telecommunications, vol. 16, no. 3, pp. 233–240, 2005. View at Publisher · View at Google Scholar · View at Scopus
  93. W. Ogryczak and T. Śliwiński, “Sequential algorithms for max-min fair bandwidth allocation,” in Proceedings of the European Computing Conference, V. Mastorakis, V. Mladenov, and V. T. Kontargyri, Eds., vol. 27 of Lecture Notes in Electrical Engineering, pp. 511–522, Springer, New York, NY, USA, 2009. View at Google Scholar
  94. W. Ogryczak and T. Śliwiński, “Sequential algorithms for exact and approximate max-min fair bandwidth allocation,” in Proceedings of the 15th International Telecommunications Network Strategy and Planning Symposium (NETWORKS '12), pp. 1–6, Rome, Italy, October 2012. View at Publisher · View at Google Scholar · View at Scopus
  95. W. Ogryczak, T. Sliwinski, and A. Wierzbicki, “Fair resource allocation schemes and network dimensioning problems,” Journal of Telecommunications and Information Technology, vol. 2003, no. 3, pp. 34–42, 2003. View at Google Scholar
  96. W. Ogryczak, A. Wierzbicki, and M. Milewski, “A multi-criteria approach to fair and efficient bandwidth allocation,” Omega, vol. 36, no. 3, pp. 451–463, 2008. View at Publisher · View at Google Scholar · View at Scopus
  97. D. Nace and J. B. Orlin, “Lexicographically minimum and maximum load linear programming problems,” Operations Research, vol. 55, no. 1, pp. 182–187, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  98. P. Nilsson and M. Pióro, “Max-min fair distribution of modular network flows on fixed paths,” in Proceedings of the 5th International IFIP-TC6 Networking Conference, vol. 3976 of Lecture Notes in Computer Science, pp. 916–927, Springer, Berlin, Germany, 2006.
  99. E. Amaldi, A. Capone, S. Coniglio, and L. G. Gianoli, “Network optimization problems subject to max-min fair flow allocation,” IEEE Communications Letters, vol. 17, no. 7, pp. 1463–1466, 2013. View at Publisher · View at Google Scholar · View at Scopus
  100. D. Santos, A. de Sousa, F. Alvelos, M. Dzida, and M. Pióro, “Optimization of link load balancing in multiple spanning tree routing networks,” Telecommunication Systems, vol. 48, no. 1-2, pp. 109–124, 2011. View at Publisher · View at Google Scholar · View at Scopus
  101. D. Santos, A. de Sousa, F. Alvelos, and M. Pióro, “Optimizing network load balancing: an hybridization approach of metaheuristics with column generation,” Telecommunication Systems, vol. 52, no. 2, pp. 959–968, 2013. View at Publisher · View at Google Scholar · View at Scopus
  102. P. Å. Nilsson and M. Pióro, “Solving dimensioning tasks for proportionally fair networks carrying elastic traffic,” Performance Evaluation, vol. 49, no. 1–4, pp. 371–386, 2002. View at Publisher · View at Google Scholar · View at Scopus
  103. E. Kubilinskas, P. Nilsson, and M. Pióro, “Design models for robust multi-layer next generation Internet core networks carrying elastic traffic,” Journal of Network and Systems Management, vol. 13, no. 1, pp. 57–76, 2005. View at Publisher · View at Google Scholar · View at Scopus
  104. M. Pióro, E. Kubilinskas, and P. Nilsson, “Resilient dimensioning of proportionally fair networks,” European Transactions on Telecommunications, vol. 16, no. 3, pp. 241–251, 2005. View at Publisher · View at Google Scholar · View at Scopus
  105. M. Pióro, M. Żotkiewicz, B. Staehle, D. Staehle, and D. Yuan, “On max-min fair flow optimization in wireless mesh networks,” Ad Hoc Networks, vol. 13, pp. 134–152, 2014. View at Publisher · View at Google Scholar · View at Scopus
  106. J. Hurkala and T. Śliwiński, “Fair flow optimization with advanced aggregation operators in Wireless Mesh Networks,” in Proceedings of the Federated Conference on Computer Science and Information Systems (FedCSIS '12), pp. 415–421, IEEE, September 2012. View at Scopus
  107. A. P. Wierzbicki, M. Makowski, and J. Wessels, Eds., Model Based Decision Support Methodology with Environmental Applications, Kluwer Academic Publishers, Dordrecht, The Netherlands, 2000.
  108. W. Ogryczak and A. Wierzbicki, “On multi-criteria approaches to bandwidth allocation,” Control and Cybernetics, vol. 33, no. 3, pp. 427–448, 2004. View at Google Scholar · View at MathSciNet · View at Scopus
  109. W. Ogryczak, M. Milewski, and A. Wierzbicki, “On fair and efficient bandwidth allocation by the multiple target approach,” in Proceedings of the 2nd Conference on Next Generation Internet Design and Engineering (NGI '06), pp. 48–55, IEEE, April 2006. View at Publisher · View at Google Scholar · View at Scopus
  110. A. Tomaszewski, “Design of optical wireless networks with fair traffic flows,” Journal of Applied Mathematics, vol. 2014, Article ID 938483, 5 pages, 2014. View at Publisher · View at Google Scholar
  111. H. Luss, “Equitable bandwidth allocation in content distribution networks,” Naval Research Logistics, vol. 57, no. 3, pp. 266–278, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  112. S. Sarkar and L. Tassiulas, “Distributed algorithms for computation of fair rates in multirate multicast trees,” in Proceedings of the 19th Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE INFOCOM '00), pp. 52–61, March 2000. View at Scopus
  113. H. Luss, “A distributed algorithm for equitable bandwidth allocation for content distribution in a tree network,” Journal of the Operational Research Society, vol. 63, no. 4, pp. 460–469, 2012. View at Publisher · View at Google Scholar · View at Scopus
  114. H. Luss, “An equitable bandwidth allocation model for video-on-demand networks,” Networks and Spatial Economics, vol. 8, no. 1, pp. 23–41, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  115. S. Sarkar and L. Tassiulas, “Fair allocation of utilities in multirate multicast networks: a framework for unifying diverse fairness objectives,” IEEE Transactions on Automatic Control, vol. 47, no. 6, pp. 931–944, 2002. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  116. S. Sarkar and L. Tassiulas, “Fair bandwidth allocation for multicasting in networks with discrete feasible set,” IEEE Transactions on Computers, vol. 53, no. 7, pp. 785–797, 2004. View at Publisher · View at Google Scholar · View at Scopus
  117. D. Chiu and R. Jain, “Analysis of the increase and decrease algorithms for congestion avoidance in computer networks,” Computer Networks and ISDN Systems, vol. 17, no. 1, pp. 1–14, 1989. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  118. L. Massoulié and J. W. Roberts, “Bandwidth sharing and admission control for elastic traffic,” Telecommunication Systems, vol. 15, no. 1-2, pp. 185–201, 2000. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  119. D. Nace, N. Doan, E. Gourdin, and B. Liau, “Computing optimal max-min fair resource allocation for elastic flows,” IEEE/ACM Transactions on Networking, vol. 14, no. 6, pp. 1272–1281, 2006. View at Publisher · View at Google Scholar · View at Scopus
  120. D. Nace, L. Nhat Doan, O. Klopfenstein, and A. Bashllari, “Max-min fairness in multi-commodity flows,” Computers and Operations Research, vol. 35, no. 2, pp. 557–573, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  121. L. Tassiulas and S. Sarkar, “Maxmin fair scheduling in wireless ad hoc networks,” IEEE Journal on Selected Areas in Communications, vol. 23, no. 1, pp. 163–173, 2005. View at Publisher · View at Google Scholar · View at Scopus
  122. K. Wakuda, S. Kasahara, Y. Takahashi, Y. Kure, and E. Itakura, “A packet scheduling algorithm for max-min fairness in multihop wireless LANs,” Computer Communications, vol. 32, no. 13-14, pp. 1437–1444, 2009. View at Publisher · View at Google Scholar · View at Scopus
  123. T. Bonald and J. Roberts, “Scheduling network traffic, SIGMETRICS perform,” Evaluation Review, vol. 34, no. 4, pp. 29–35, 2007. View at Google Scholar
  124. S. Lai and B. Ravindran, “Achieving max-min lifetime and fairness with rate allocation for data aggregation in sensor networks,” Ad Hoc Networks, vol. 9, no. 5, pp. 821–834, 2011. View at Publisher · View at Google Scholar · View at Scopus
  125. A. Gogu, D. Nace, S. Chatterjea, and A. Dilo, “Max-min fair link quality in WSN based on SINR,” Journal of Applied Mathematics, vol. 2014, Article ID 693212, 11 pages, 2014. View at Publisher · View at Google Scholar
  126. P. B. Coulter, “Measuring the inequality of urban public services: a methodological discussion with applications,” Policy Studies Journal, vol. 8, pp. 693–698, 1980. View at Google Scholar
  127. L. D. Mayhew and G. Leonardi, “Equity, efficiency, and accessibility in urban and regional health-care systems,” Environment and Planning A, vol. 14, pp. 1479–1507, 1982. View at Publisher · View at Google Scholar · View at Scopus
  128. M. Labbe, D. Peeters, and J.-F. Thisse, “Location on networks,” in Handbook in Operations Research and Management Science: Network Routing, M. O. Ball, T. L. Magnanti, C. L. Monma, and G. L. Nemhauser, Eds., pp. 551–624, North-Holland, Amsterdam, The Netherlands, 1996. View at Google Scholar
  129. J. Malczewski and W. Ogryczak, “An interactive approach to the central facility location problem: locating pediatric hospitals in Warsaw,” Geographical Analysis, vol. 22, no. 3, pp. 244–258, 1990. View at Google Scholar · View at Scopus
  130. W. Ogryczak, “On the distribution approach to location problems,” Computers and Industrial Engineering, vol. 37, no. 3, pp. 595–612, 1999. View at Publisher · View at Google Scholar · View at Scopus
  131. M. M. Kostreva, W. Ogryczak, and D. W. Tonkyn, “Relocation problems arising in conservation biology,” Computers and Mathematics with Applications, vol. 37, no. 4-5, pp. 135–150, 1999. View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  132. O. Berman, “Mean-variance location problems,” Transportation Science, vol. 24, no. 4, pp. 287–293, 1990. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  133. O. Maimon, “The variance equity measure in locational decision theory,” Annals of Operations Research, vol. 6, no. 5, pp. 147–160, 1986. View at Publisher · View at Google Scholar · View at Scopus
  134. E. Erkut, “Inequality measures for location problems,” Location Science, vol. 1, pp. 199–217, 1993. View at Google Scholar
  135. O. Maimon, “An algorithm for the Lorenz measure in locational decisions on trees,” Journal of Algorithms, vol. 9, no. 4, pp. 583–596, 1988. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  136. M. B. Mandell, “Modelling effectiveness-equity trade-offs in public service delivery systems,” Management Science, vol. 37, no. 4, pp. 467–482, 1991. View at Google Scholar
  137. W. Ogryczak, “Inequality measures and equitable locations,” Annals of Operations Research, vol. 167, pp. 61–86, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  138. M. M. Kostreva and W. Ogryczak, “Equitable approaches to location problems,” in Spatial Multicriteria Decision Making and Analysis: A Geographic Informatio Sciences Approach, J .C. Thill, Ed., pp. 103–126, Ashgate, London, UK, 1999. View at Google Scholar
  139. W. Ogryczak, “On cent-dians of general networks,” Location Science, vol. 5, no. 1, pp. 15–28, 1997. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  140. P. J. Slater, “Centers to centroids in graphs,” Journal of Graph Theory, vol. 2, no. 3, pp. 209–222, 1978. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  141. A. Tamir, “The k-centrum multi-facility location problem,” Discrete Applied Mathematics, vol. 109, no. 3, pp. 293–307, 2001. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  142. W. Ogryczak and M. Zawadzki, “Conditional median: a parametric solution concept for location problems,” Annals of Operations Research, vol. 110, pp. 167–181, 2002. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  143. W. Ogryczak and T. Sliwinski, “On equitable approaches to resource allocation problems: the conditional minimax solution,” Journal of Telecommunications and Information Technology, vol. 2002, no. 3, pp. 40–48, 2002. View at Google Scholar
  144. S. Nickel and J. Puerto, Location Theory: A Unified Approach, Springer, Berlin, Germany, 2005.
  145. A. Neidhardt, H. Luss, and K. R. Krishnan, “Data fusion and optimal placement of fixed and mobile sensors,” in Proceedings of the 3rd IEEE Sensors Applications Symposium (SAS '08), pp. 128–133, Atlanta, Ga, USA, February 2008. View at Scopus
  146. N. Megiddo, “Optimal flows in networks with multiple sources and sinks,” Mathematical Programming, vol. 7, no. 1, pp. 97–107, 1974. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  147. L. Georgiadis, P. Georgatsos, K. Floros, and S. Sartzetakis, “Lexicographically optimal balanced networks,” in Proceedings of the 20th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM '01), vol. 2, pp. 689–698, Anchorage, AK, USA, April 2001. View at Scopus
  148. J. Kleinberg, Y. Rabani, and E. Tardos, “Fairness in routing and load balancing,” Journal of Computer and System Sciences, vol. 63, no. 1, pp. 2–21, 2001. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  149. P. Nilsson, Fairness in communication and computer network design [Ph.D. thesis], Lund University, Lund, Sweden, 2006.
  150. E. Amaldi, S. Coniglio, L. G. Gianoli, and C. U. Ileri, “On single-path network routing subject to max-min fair flow allocation,” Electronic Notes in Discrete Mathematics, vol. 41, no. 5, pp. 543–550, 2013. View at Publisher · View at Google Scholar · View at Scopus
  151. M. Köppen, K. Yoshida, K. Ohnishi, and M. Tsuru, “Meta-heuristic approach to proportional fairness,” Evolutionary Intelligence, vol. 5, no. 4, pp. 231–244, 2012. View at Publisher · View at Google Scholar · View at Scopus
  152. J. Kalcsics, “Improved complexity results for several multifacility location problems on trees,” Annals of Operations Research, vol. 191, pp. 23–36, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  153. J. Kalcsics, S. Nickel, J. Puerto, and A. Tamir, “Algorithmic results for ordered median problems,” Operations Research Letters, vol. 30, no. 3, pp. 149–158, 2002. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  154. P. Brucker, S. A. Kravchenko, and Y. N. Sotskov, “On the complexity of two machine job-shop scheduling with regular objective functions,” OR Spektrum, vol. 19, no. 1, pp. 5–10, 1997. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  155. P. Brucker, Y. N. Sotskov, and F. Werner, “Complexity of shop-scheduling problems with fixed number of jobs: a survey,” Mathematical Methods of Operations Research, vol. 65, no. 3, pp. 461–481, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  156. M. R. Garey, D. S. Johnson, and R. Sethi, “The complexity of flowshop and jobshop scheduling,” Mathematics of Operations Research, vol. 1, no. 2, pp. 117–129, 1976. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  157. N. V. Shakhlevich, Y. N. Sotskov, and F. Werner, “Complexity of mixed shop scheduling problems: a survey,” European Journal of Operational Research, vol. 120, no. 2, pp. 343–351, 2000. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  158. Y. Mati, S. Dauzère-Pérès, and C. Lahlou, “A general approach for optimizing regular criteria in the job-shop scheduling problem,” European Journal of Operational Research, vol. 212, no. 1, pp. 33–42, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  159. M. L. Balinski and H. P. Young, Fair Representation: Meeting the Ideal of One Man, Yale University Press, New Haven, Conn, USA, 1982. View at MathSciNet
  160. H. Groeflin, H. Luss, M. B. Rosenwein, and E. T. Wahls, “Final assembly sequencing for just-in-time manufacturing,” International Journal of Production Research, vol. 27, no. 2, pp. 199–213, 1989. View at Publisher · View at Google Scholar · View at Scopus
  161. F. Dugardin, F. Yalaoui, and L. Amodeo, “New multi-objective method to solve reentrant hybrid flow shop scheduling problem,” European Journal of Operational Research, vol. 203, no. 1, pp. 22–31, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  162. M. C. López-de-los-Mozos, J. A. Mesa, and J. Puerto, “A generalized model of equality measures in network location problems,” Computers and Operations Research, vol. 35, no. 3, pp. 651–660, 2008. View at Publisher · View at Google Scholar · View at Scopus
  163. Z. Chen, “A modified resource distribution fairness measure,” Journal of Mathematics, vol. 2013, Article ID 956039, 6 pages, 2013. View at Publisher · View at Google Scholar · View at MathSciNet
  164. W. Ogryczak, “On principles of fair resource allocation for importance weighted agents,” in Proceedings of the International Workshop on Social Informatics (SOCINFO '09), pp. 57–62, Warsaw, Poland, June 2009. View at Publisher · View at Google Scholar · View at Scopus
  165. V. Torra, “The weighted OWA operator,” International Journal of Intelligent Systems, vol. 12, no. 2, pp. 153–166, 1997. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  166. V. Torra and Y. Narukawa, Modeling Decisions Information Fusion and Aggregation Operators, Springer, Berlin, Germany, 2007.
  167. W. Ogryczak and T. Śliwiński, “On Optimization of the importance weighted OWA aggregation of multiple criteria,” in Computational Science and Its Applications—ICCSA 2007, vol. 4705 of Lecture Notes in Computer Science, pp. 804–817, 2007. View at Publisher · View at Google Scholar
  168. W. Ogryczak and T. Śliwiński, “On efficient WOWA optimization for decision support under risk,” International Journal of Approximate Reasoning, vol. 50, no. 6, pp. 915–928, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  169. J. Hurkała and T. Śliwiński, “Threshold accepting heuristic for fair flow optimization in wireless mesh networks,” Journal of Applied Mathematics, vol. 2014, Article ID 108673, 11 pages, 2014. View at Publisher · View at Google Scholar
  170. Ľ. Buzna, M. Koháni, and J. Janáček, “An approximation aLgorithm for the facility location problem with lexicographic minimax objective,” Journal of Applied Mathematics, vol. 2014, Article ID 562373, 12 pages, 2014. View at Publisher · View at Google Scholar · View at MathSciNet
  171. A. Ghodsi, M. Zaharia, B. Hindman, A. Konwinski, S. Shenker, and I. Stoica, “Dominant resource fairness: fair allocation of multiple resource types,” in Proceedings of the 8th USENIX Conference on Networked Systems Design and Implementation, pp. 24–37, USENIX Association, 2011.
  172. M. Köppen, K. Ohnishi, and M. Tsuru, “Multi-Jain fairness index of per-entity allocation features for fair and efficient allocation of network resources,” in Proceedings of the 5th International Conference on Intelligent Networking and Collaborative Systems (INCoS '13), pp. 841–846, Xi'an, China, 2013.
  173. C. Joe-Wong, S. Sen, T. Lan, and M. Chiang, “Multi-resource allocation: fairness-efficiency tradeoffs in a unifying framework,” in Proceedings of the IEEE Conference on Computer Communications (INFOCOM '12), pp. 1206–1214, March 2012. View at Publisher · View at Google Scholar · View at Scopus
  174. A. Wierzbicki, Trust and Fairness in Open, Distributed Systems, Springer, Berlin, Germany, 2010.
  175. S. Hsu and A. S. Tsai, “A game-theoretic analysis of bandwidth allocation under a user-grouping constraint,” Journal of Applied Mathematics, vol. 2013, Article ID 480962, 9 pages, 2013. View at Publisher · View at Google Scholar · View at Scopus
  176. N. Nisam, T. Roughgarden, E. Tardos, and V. V. Vazirani, Eds., Algorithmic Game Theory, Cambridge University Press, Cambridge, UK, 2007.
  177. K. Rzadca, D. Trystram, and A. Wierzbicki, “Fair game-theoretic resource management in dedicated grids,” in Proceedings of the 7th IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07), pp. 343–350, May 2007. View at Publisher · View at Google Scholar · View at Scopus