A non-dual signature method for the assignment problem and a generalization of the dual simplex method for the transportation problem
RAIRO - Operations Research - Recherche Opérationnelle, Tome 22 (1988) no. 3, pp. 269-289. 
@article{RO_1988__22_3_269_0,
     author = {Paparrizos, Konstantinos},
     title = {A non-dual signature method for the assignment problem and a generalization of the dual simplex method for the transportation problem},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {269--289},
     publisher = {EDP-Sciences},
     volume = {22},
     number = {3},
     year = {1988},
     mrnumber = {968629},
     zbl = {0664.90055},
     language = {en},
     url = {http://www.numdam.org/item/RO_1988__22_3_269_0/}
}
TY  - JOUR
AU  - Paparrizos, Konstantinos
TI  - A non-dual signature method for the assignment problem and a generalization of the dual simplex method for the transportation problem
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 1988
SP  - 269
EP  - 289
VL  - 22
IS  - 3
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/RO_1988__22_3_269_0/
LA  - en
ID  - RO_1988__22_3_269_0
ER  - 
%0 Journal Article
%A Paparrizos, Konstantinos
%T A non-dual signature method for the assignment problem and a generalization of the dual simplex method for the transportation problem
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 1988
%P 269-289
%V 22
%N 3
%I EDP-Sciences
%U http://www.numdam.org/item/RO_1988__22_3_269_0/
%G en
%F RO_1988__22_3_269_0
Paparrizos, Konstantinos. A non-dual signature method for the assignment problem and a generalization of the dual simplex method for the transportation problem. RAIRO - Operations Research - Recherche Opérationnelle, Tome 22 (1988) no. 3, pp. 269-289. http://www.numdam.org/item/RO_1988__22_3_269_0/

1. M. L. Balinski, Signatures des points extrêmes du polyhèdres dual du problème de transport, C.R. Acad. Sci. Paris, 296, Série I, pp. 456-459, 1983. | MR | Zbl

2. M. L. Balinski, Signature Methods for the Assignment Problem, Operations Research, 33, 1985, pp. 527-537. | MR | Zbl

3. M. L. Balinski, A Competitive (dual) Simplex Method for the Assignment Problem, Mathematical Programming, 34, 1986, pp. 125-141. | MR | Zbl

4. M. L. Balinski and R. E. Gomory, A Primal Method for the Assignment and Transportation Problems, Management Science, 10, 1964, pp. 578-593.

5. R. Barr, F. Glover and D. Klingman, The Alternating path Basis Algorithm for Assignment Problems, Mathematical Programming, Vol. 13, 1977, pp. 1-13. | MR | Zbl

6. D. Bertsekas, A new algorithm for the Assignment Problem, Mathematical Programming, Vol. 21, 1981, pp. 152-171. | MR | Zbl

7. W. H. Cunningham, A Network Simplex Method, Mathematical Programming, Vol. 11, 1976, pp. 105-116. | MR | Zbl

8. W. H. Cunningham and A. B. Marsh, III, A Primai Algorithm for Optimum Matching, Mathematical Programming Study, 8, 1978, pp. 50-72. | Zbl

9. E. A. Dinic and M. A. Kronrad, An Algorithm for the Solution of the Assignment Problem, Soviet Mathematics Doklady, Vol. 10, 1969, pp. 248-264. | Zbl

10. J. Endmonds and R. M. Karp, Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems, Journal of the Association for Computing Machinery, Vol. 19, 1972, pp. 248-264. | Zbl

11. L. R. Ford and D. R. Fulkerson, Flows in Networks, Princeton University Press, Princeton, 1962. | MR | Zbl

12. D. Goldfarb, Efficient dual Simplex Methods for the Assignment Problem, Mathematical Programming, Vol. 33, 1985, pp. 127-203. | MR | Zbl

13. M. S. Hung, A Polynomial Simplex Method for the Assignment Problem, Operations Research, Vol. 31, 1983, pp. 595-600. | MR | Zbl

14. M. S. Hung and W. O. Rom, Solving the Assignment Problem by Relaxation, Operations Research, Vol. 28, 1980, pp. 969-982. | MR | Zbl

15. H. W. Kuhn, The Hungarian Method for the Assignment Problem, Naval Research Logistics Quarterly, Vol. 2, 1955, pp. 83-97. | MR | Zbl

16. E. Lawler, Combinatorial Optimization, Network and Matroids, Holt, Rinchart and Winston, New York, 1976. | MR | Zbl

17. J. Munkres, Algorithms for the Assignment and Transportation Problems, S.I.A.M. Journal, Vol. 5, 1957, pp. 83-97. | MR | Zbl

18. E. Roohy-Laleh, Improvement to the Theoretical Efficiency of the Network Simplex Method, Ph. D. Thesis, Carleton University, 1981. | MR

19. V. Srinivasen and G. L. Thomson, Cost Operator Algorithms for the Transportation Problem, Mathematical Programming, Vol. 12, 1977, pp. 372-391. | MR | Zbl

20. G. L. Thomson, A Recursive Method for the Assignment Problems, Annals of Discrete Mathematics, Vol. 11, 1981, pp. 319-343. | Zbl

21. N. Tomizawa, On some Techniques Usefull for Solution of Transportation Network Problems, Network, Vol. 1, 1972, pp. 173-194. | MR | Zbl