Author:
Balinski M. L.,Rispoli Fred J.
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference20 articles.
1. J.L. Ahrens, “Counting basic feasible solutions of transportation problems,”Operations Research Verfahren 31 (1978) 29–43.
2. M.L. Balinski, “On two special classes of transportation polytopes,”Mathematical Programming Study 1 (1974) 43–58.
3. M.L. Balinski, “The Hirsch conjecture for dual transportation polyhedra,”Mathematics of Operations Research 9 (1984) 629–633.
4. M.L. Balinski, “Signature methods for the assignment problem,”Operations Research 33 (1985) 527–536.
5. M.L. Balinski, “A competitive (dual) simplex method for the assignment problem,”Mathematical Programming 34 (1986) 125–141.
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献