A new implementation of an algorithm for the optimal assignment problem: An improved version of Munkres' algorithm

DOI10.1007/BF01930994MaRDI QIDQ3048271zbMATH OpenFDO

Authors Jin Kue Wong

Publication date 1979

Published in BIT (Search for Journal in Brave)

zbMATH Keywords

computational complexityanalysis of algorithmsnetwork flowoptimal assignment problemworst-case time

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Discrete mathematics in relation to computer science (68R99)

Cites work

• Algorithms for the Assignment and Transportation Problems
• An algorithm for the assignment problem
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

This page was built for publication: A new implementation of an algorithm for the optimal assignment problem: An improved version of Munkres' algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3048271)