Implementation and Testing of a Primal-Dual Algorithm for the Assignment Problem

Leon F. McGinnis
Additional contact information
Leon F. McGinnis: Georgia Institute of Technology, Atlanta, Georgia

Operations Research, 1983, vol. 31, issue 2, 277-291

Abstract: State-of-the-art computational results have shown that primal simplex algorithms are more efficient than primal-dual algorithms for general minimum cost network flow problems. There is, however, some controversy concerning their relative merits for solving assignment problems. This paper presents a detailed development for a computationally efficient primal-dual algorithm and extensive computational comparisons to primal simplex algorithms.

Keywords: 481; assignment; algorithms (search for similar items in EconPapers)
Date: 1983
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.31.2.277 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:31:y:1983:i:2:p:277-291

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().