Improving the Hungarian assignment algorithm

DOI10.1016/0167-6377(86)90073-8zbMath0606.90111MaRDI QIDQ1085073

Ton Volgenant, Roy Jonker

Publication date: 1986

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(86)90073-8

zbMATH Keywords

Hungarian linear assignment algorithm; shortest augmenting paths

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C27: Combinatorial optimization

Related Items

A comprehensive simplex-like algorithm for network optimization and perturbation analysis, A decision support system for the single-depot vehicle rescheduling problem, An addendum on the incremental assignment problem, Authors' response to ``An addendum on the incremental assignment problem by Volgenant, A shortest augmenting path algorithm for dense and sparse linear assignment problems, Travelling salesman problem tools for microcomputers, Personnel placement in a fuzzy environment, Speeding up the Hungarian algorithm, Algorithms and codes for dense assignment problems: The state of the art, Tolerance-based branch and bound algorithms for the ATSP, Iterative patching and the asymmetric traveling salesman problem, Parallel Auction Algorithm for Bus Rescheduling

Uses Software

• Algorithm 548

Cites Work

• Unnamed Item
• Unnamed Item
• Algorithm for the solution of the assignment problem for sparse matrices
• An algorithm for the assignment problem
• Efficient dual simplex algorithms for the assignment problem
• Signature Methods for the Assignment Problem
• Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems
• A new algorithm for the assignment problem
• Implementation and Testing of a Primal-Dual Algorithm for the Assignment Problem