Technical Note—A Note on Parametric Analysis in Linear Assignment

References

• Ahuja R. K., Magnanti T. L., Orlin J. B.Network Flows: Theory, Algorithms, and Applications (1993) (Prentice-Hall, Englewood Cliffs, NJ) Google Scholar
• Anstreicher K. M. Linear programming in O([n3/ln n] L) operations. SIAM J. Optim. (1999) 9:803–812Crossref, Google Scholar
• Dell'Amico M., Toth P. Algorithms and codes for dense assignment problems: The state of the art. Discrete Appl. Math. (2000) 100:17–48Crossref, Google Scholar
• Derigs U., Zimmerman U. An augmenting path method for solving linear bottleneck assignment problems. Computing (1978) 19:285–295Crossref, Google Scholar
• Fredman M. L., Tarjan R. E. Fibonacci heaps and their uses in network optimization algorithms. J. ACM (1987) 34:596–615Crossref, Google Scholar
• Gabow H. N., Tarjan R. E. Faster scaling algorithms for network problems. SIAM J. Comput. (1989) 18:1013–1036Crossref, Google Scholar
• Gal T.Postoptimal Analyses, Parametric Programming, and Related Topics (1995) 2nd ed.(W. de Gruyter & Co., New York) Google Scholar
• Holder A. Navy personnel planning and the optimal partition. Oper. Res. (2005) 53:77–89Link, Google Scholar
• Kindervater G., Volgenant A., de Leve G., van Gijlswijk V. On dual solutions for the linear assignment problem. Eur. J. Oper. Res. (1985) 19:76–81Crossref, Google Scholar
• Punnen A. P., Nair P. K. P. Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem. Discrete Appl. Math. (1994) 55:91–93Crossref, Google Scholar
• Uno T.A Fast Algorithm for Enumerating Bipartite Perfect Matchings. Lecture Notes on Computer Science (2001) 2223(Springer-Verlag, Berlin/Heidelberg) 367–379ISAAC 2001Google Scholar