Technical Note—A “Hard” Assignment Problem
Robert E. Machol, Michael Wien
Operations Research · 1976 · Volume 24 · Issue 1
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.
Enable JavaScript for citation tools and additional paper interactions.