Author:
Armstrong Ronald D.,Jin Zhiying
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference11 articles.
1. R.K. Ahuja, T.L. Magnanti and J.B. Orlin,Network Flows: Theory, Algorithms, and Applications (Prentice-Hall, Englewood Cliffs, NJ, 1993).
2. R.D. Armstrong and Z. Jin. Solving linear bottleneck assignment problems via strong spanning trees,Operations Research Letters 12 (1992) 179–180.
3. R.D. Armstrong and Z. Jin, Strongly polynomial simplex method for bipartite vertex packing,Discrete Applied Mathematics 64 (1996) 97–103.
4. M.L. Balinski, A competitive (dual) simplex method for the assignment problem,Mathematical Programming 34 (1986) 125–141.
5. M.L. Balinski and J. Gonzalez, Maximum matching in bipartite graphs via strong spanning trees,Networks 21 (1991) 165–179.
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献