A non-dual signature method for the assignment problem and a generalization of the dual simplex method for the transportation problem-Reference-Cited by-同舟云学术

A non-dual signature method for the assignment problem and a generalization of the dual simplex method for the transportation problem

Published:1988 Issue:3 Volume:22 Page:269-289
ISSN:0399-0559
Container-title:RAIRO - Operations Research
language:
Short-container-title:RAIRO-Oper. Res.

Author:

Paparrizos Konstantinos

Publisher

EDP Sciences

Subject

Management Science and Operations Research,Computer Science Applications,Theoretical Computer Science

Link

http://www.rairo-ro.org/10.1051/ro/1988220302691/pdf

Reference21 articles.

1. 1. BALINSKI M. L., 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.7019100527.90069

2. 2. BALINSKI M. L., Signature Methods for the Assignment Problem, Operations Research, 33, 1985, pp. 527-537.7917050583.90064

3. 3. BALINSKI M. L., A Competitive (dual) Simplex Method for the Assignment Problem, Mathematical Programming, 34, 1986, pp. 125-141.8384740596.90064

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

5. 5. BARR R., GLOVER F. and KLINGMAN D., The Alternating path Basis Algorithm for Assignment Problems, Mathematical Programming, Vol. 13, 1977, pp. 1-13.4440390378.90097

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Exterior point simplex-type algorithms for linear and network optimization problems;Annals of Operations Research;2015-01-01

2. On the initialization methods of an exterior point algorithm for the assignment problem;International Journal of Computer Mathematics;2010-07

3. Linear Assignment Problems and Extensions;Handbook of Combinatorial Optimization;1999

4. The Linear Assignment Problem;Combinatorial Optimization;1992

5. An infeasible (exterior point) simplex algorithm for assignment problems;Mathematical Programming;1991-07