# A dual feasible forest algorithm for the linear assignment problem

RAIRO - Operations Research - Recherche Opérationnelle (1991)

- Volume: 25, Issue: 4, page 403-411
- ISSN: 0399-0559

## Access Full Article

top## How to cite

topAkgül, M., and Ekin, O.. "A dual feasible forest algorithm for the linear assignment problem." RAIRO - Operations Research - Recherche Opérationnelle 25.4 (1991): 403-411. <http://eudml.org/doc/105022>.

@article{Akgül1991,

author = {Akgül, M., Ekin, O.},

journal = {RAIRO - Operations Research - Recherche Opérationnelle},

keywords = {dual simplex method; signatures; pivoting; average behavior; dual feasible forest algorithm; assignment; strongly feasible tree},

language = {eng},

number = {4},

pages = {403-411},

publisher = {EDP-Sciences},

title = {A dual feasible forest algorithm for the linear assignment problem},

url = {http://eudml.org/doc/105022},

volume = {25},

year = {1991},

}

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

PB - EDP-Sciences

VL - 25

IS - 4

SP - 403

EP - 411

LA - eng

KW - dual simplex method; signatures; pivoting; average behavior; dual feasible forest algorithm; assignment; strongly feasible tree

UR - http://eudml.org/doc/105022

ER -

## References

top- 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. Zbl0654.90053MR948384
- 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.). Zbl0808.90089MR1237264
- 3. M. L. BALINSKI, Signature Method for the Assignment Problem, Oper. Res., 1985, 33, pp. 527-536. Zbl0583.90064MR791705
- 4. M. L. BALINSKI, A Competitive (Dual) Simplex Method for the Assignment Problem, Math. Programming, 1986, 34, pp. 125-141 Zbl0596.90064MR838474
- 5. R. BARR, F. GLOVER and D. KLINGMAN, The Alternating Basis Algorithm for Assignment Problems, Math. Programming, 1977, 13, pp. 1-13. Zbl0378.90097MR444039
- 6. W. H. CUNNINGHAM, A Network Simplex Method, Math. Programming, 1976, 11, pp. 105-116. Zbl0352.90039MR462532
- 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. MR904195
- 8. D. GOLDFARB, Efficient Dual Simplex Algorithms for the Assignment Problem, Math. Programming, 1985, 33, pp. 187-203. Zbl0578.90051MR808910
- 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. Zbl0664.90055MR968629

## NotesEmbed ?

topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.