Fast linear sum assignment with error-correction and no cost constraints

Sébastien Bougleux, Benoit Gaüzère, David B. Blumenthal, Luc Brun

Abstract: Highlights•We propose an efficient procedure for solving the linear sum assignment problem with error-correction.•In contrast to most efficient competitors, our procedure does not impose constraints on the costs.•Our procedure is more stable than existing competitors.•Our procedure can be implemented more easily than existing competitors.