Lexicographically Minimum and Maximum Load Linear Programming Problems

References

• Ahuja R. K., Magnanti T. L., Orlin J. B.Network Flows: Theory, Algorithms and Applications (1993) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
• Freund R. M., Mizuno S., Frenk H., Roos K., Terlaky T., Zhang S. Interior point methods: Current status and future directions. High Performance Optimization (2003) 33(Kluwer Academic Publishing, Dordrecht, The Netherlands) 441–446Applied OptimizationGoogle Scholar
• Freund R. M., Roundy R., Todd M. J. Identifying the set of always-active constraints in a system of linear inequalities by a single linear program. (1985) . Technical report, Note 1674-85, Sloan School of Management, Massachusetts Institute of Technology, Cambridge, MAGoogle Scholar
• Georgiadis L., Georgatsos P., Floros K., Sartzetakis S. Lexicographically optimal balanced networks. Infocom (2001) 689–698Google Scholar
• Kern W., Paulusma D. Matching games: The least core and the nucleolus. Math. Oper. Res. (2003) 28(2):294–308Link, Google Scholar
• Kleinberg J. M., Rabani Y., Tardos E. Fairness in routing and load balancing. IEEE Sympos. Foundations Comput. Sci. (1999) 568–578Crossref, Google Scholar
• Kleinrock L.Communications Nets: Stochastic Message Flow and Delay (1964) (McGraw-Hill, New York) Google Scholar
• Megiddo N. Optimal flows in networks with sources and sinks. Math. Programming (1974) 7(1):97–101Crossref, Google Scholar
• Nace D. A linear programming based approach for computing optimal splittable fair routing. Seventh IEEE Sympos. Comput. Comm. 2002 (2002) 468–474Crossref, Google Scholar
• Pioro M., Medhi D.Routing, Flow and Capacity Design in Communication and Computer Networks (2004) (Morgan Kaufmann Publishers, San Francisco, CA) Google Scholar
• Radunovic B., Le Boudec J. A unified framework for max-min and min-max fairness with applications. (2002) . http://Citeseer.ist.psu.edu/radunovic02unified.htmlGoogle Scholar
• Schmeidler D. The nucleolus of a characteristic function game. SIAM J. Appl. Math. (1969) 17:1163–1170Crossref, Google Scholar
• Schneider H., Schneider M. Max-balancing weighted directed graphs and matrix scaling. Math. Oper. Res. (1991) 16:208–222Link, Google Scholar
• Shahrokhi F., Matula D. W. The maximum concurrent flow problem. J. ACM (1990) 37:318–334Crossref, Google Scholar
• Young N. E., Tarjan R. E., Orlin J. B. Faster parametric shortest path and minimum balance algorithms. Networks (1991) 21:205–221Crossref, Google Scholar