The shortest augmenting path method for solving assignment problems — Motivation and computational experience

In this paper we discuss the shortest augmenting path method for solving assignment problems in the following respect:we introduce this basic concept using matching theorywe present several efficient labeling techniques for constructing shortest augmenting pathswe show the relationship of this approach to several classical assignment algorithmswe present extensive computational experience for complete problems, andwe show how postoptimal analysis can be performed using this approach and naturally leads to a new, highly efficient hybrid approach for solving large-scale dense assignment problems