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

Publisher Website
Google Scholar
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.

This publication has 0 references indexed in Scilit: