论文信息 - A polynomial algorithm for solving a general max-min fairness problem

A polynomial algorithm for solving a general max-min fairness problem

An iterative algorithm of polynomial complexity is presented that solves a max-min fairness problem which is often encountered while dealing with traffic routing or capacity allocation problems. The algorithm does not depend on any specific traffic routing problem formulation and is sufficiently general to be applied to a broad class of traffic routing and capacity allocation problems. The correctness of the algorithm and its complexity are formally proved.

Artur Tomaszewski | A. Tomaszewski

[1] Wlodzimierz Ogryczak,et al. On solving linear programs with the ordered weighted averaging objective , 2003, Eur. J. Oper. Res..

[2] Frank Kelly,et al. Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[3] J. Oviedo,et al. Lexicographic optimality in the multiple objective linear programming: The nucleolar solution , 1992 .

[4] Michal Pióro,et al. On efficient max-min fair routing algorithms , 2003, Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003.

[5] Dritan Nace,et al. A linear programming based approach for computing optimal fair splittable routing , 2002, Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications.

[6] F. Behringer. A simplex based algorithm for the lexicographically extended linear maxmin problem , 1981 .

[7] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[8] Dimitri P. Bertsekas,et al. Data Networks , 1986 .