A Genuinely Polynomial Primal Simplex Algorithm for the Assignment Problem

@article{Akgl1993AGP,
  title={A Genuinely Polynomial Primal Simplex Algorithm for the Assignment Problem},
  author={Mustafa Akg{\"u}l},
  journal={Discrete Applied Mathematics},
  year={1993},
  volume={45},
  pages={93-115}
}
Akgiil, M., A genuinely polynomial primal simplex algorithm for the assignment problem, Discrete Applied Mathematics 45 (1993) 93-l 15. We present a primal simplex algorithm that solves the assignment problem in :n(n+3)-4 pivots. Starting with a problem of size 1, we sequentially solve problems of size 2,3,4,. ..,lt. The algorithm utilizes degeneracy by working with strongly feasible trees and employs Dantdg’s rule for entering edges for the subproblem. The number of nondegenerate simplex… CONTINUE READING
15 Citations
29 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 29 references

Ekin, A dual feasible forest algorithm for the linear assignment problem, Res. Optr

  • M. Akgiil
  • 1991

A sequential dual simplex algorithm for the linear assignment problem

  • M. Akgiil
  • Oper. Res. Lett
  • 1988
2 Excerpts

Shortest paths and the simplex method, Working Paper IEOR 88-04

  • M. Akgiil
  • Bilkent University, Ankara
  • 1988

The shortest augmenting path method for solving assignment problems-motivation and computational experience, Ann

  • U. Derigs
  • Oper. Res
  • 1985

Topics in Relaxation and Ellipsoidal Methods, Research Notes in Mathematics 97 (Pitman

  • M. Akgiil 121 M. Akgiil
  • Working Paper IEOR 87-07,
  • 1984

Similar Papers

Loading similar papers…