Author:
Cunningham W. H.,Marsh A. B.
Publisher
Springer Berlin Heidelberg
Reference23 articles.
1. M.L. Balinski, “Establishing the matching polytope”, Journal of Combinatorial Theory B 13 (1972) 1–13.
2. M.L. Balinski and R.E. Gomory, “A primal method for the assignment and transportation problems”, Management Science 10 (1964) 578–593.
3. R.S. Barr, F. Glover and D. Klingman, “The alternating basis algorithm for assignment problems”, Mathematical Programming 13 (1977) 1–13.
4. N. Christofides, “Worst-case analysis of a new heuristic for the traveling salesman problem”, GSIA, Carnegie-Mellon University (1976).
5. W.H. Cunningham, “A network simplex method”, Mathematical Programming 11 (1976) 105–116.
Cited by
122 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献