Technical Note—A “Hard” Assignment Problem

Authors:

Abstract
We construct numerical examples that force Hungarian-method algorithms for the assignment problem to their worst-case time bounds. These bounds are thereby clarified.