no. 4
A dual feasible forest algorithm for the linear assignment problem
RAIRO - Operations Research - Recherche Opérationnelle, Tome 25 (1991) no. 4, pp. 403-411 
@article{RO_1991__25_4_403_0,
     author = {Akg\"ul, M. and Ekin, O.},
     title = {A dual feasible forest algorithm for the linear assignment problem},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {403--411},
     year = {1991},
     publisher = {EDP Sciences},
     volume = {25},
     number = {4},
     mrnumber = {1143501},
     zbl = {0744.90088},
     language = {en},
     url = {https://www.numdam.org/item/RO_1991__25_4_403_0/}
}
TY  - JOUR
AU  - Akgül, M.
AU  - Ekin, O.
TI  - A dual feasible forest algorithm for the linear assignment problem
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 1991
SP  - 403
EP  - 411
VL  - 25
IS  - 4
PB  - EDP Sciences
UR  - https://www.numdam.org/item/RO_1991__25_4_403_0/
LA  - en
ID  - RO_1991__25_4_403_0
ER  - 
%0 Journal Article
%A Akgül, M.
%A Ekin, O.
%T A dual feasible forest algorithm for the linear assignment problem
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 1991
%P 403-411
%V 25
%N 4
%I EDP Sciences
%U https://www.numdam.org/item/RO_1991__25_4_403_0/
%G en
%F RO_1991__25_4_403_0
Akgül, M.; Ekin, O. A dual feasible forest algorithm for the linear assignment problem. RAIRO - Operations Research - Recherche Opérationnelle, Tome 25 (1991) no. 4, pp. 403-411. https://www.numdam.org/item/RO_1991__25_4_403_0/

1. M. Akgül, A Sequential Dual Simplex Algorithm for the Linear Assignment Problem, Oper. Res. Lett., 1988, 7, pp. 155-158; 1989, 8, p. 117. | Zbl | MR

2. M. Akgül, A Genuinely Polynomial Primal Simplex Algorithm for the Assignment Problem, SERC Report IEOR 87-07, Bilkent University, 1987 (To appear in Discrete Appl. Math.). | Zbl | MR

3. M. L. Balinski, Signature Method for the Assignment Problem, Oper. Res., 1985, 33, pp. 527-536. | Zbl | MR

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

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

6. W. H. Cunningham, A Network Simplex Method, Math. Programming, 1976, 11, pp. 105-116. | Zbl | MR

7. M. Fredman and R. Tarjan, Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms, J. A.C.M., 1987, 34, pp. 596-615. | MR

8. D. Goldfarb, Efficient Dual Simplex Algorithms for the Assignment Problem, Math. Programming, 1985, 33, pp. 187-203. | Zbl | MR

9. K. Paparrizos, A Non-Dual Signature Method for the Assignment Problem and a Generalization of the Dual Simplex Method for the Transportation Problem, R.A.I.R.O. Rech. Opér., 1988, 22, pp. 269-289. | Zbl | MR | Numdam