Improving the Hungarian assignment algorithm

DOI10.1016/0167-6377(86)90073-8zbMath0606.90111OpenAlexW2076554191MaRDI 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 algorithmshortest augmenting paths

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Combinatorial optimization (90C27)

Related Items

A shortest augmenting path algorithm for dense and sparse linear assignment problems, Index Matrices as a Cost Optimization Tool of Resource Provisioning in Uncertain Cloud Computing Environment, A decision support system for the single-depot vehicle rescheduling problem, The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems, Node Matching Computation Between Two Large Graphs in Linear Computational Cost, Sensitivity analysis for bottleneck assignment problems, Multistart Branch and Bound for Large Asymmetric Distance-Constrained Vehicle Routing Problem, Parallel Auction Algorithm for Bus Rescheduling, Algorithms and codes for dense assignment problems: The state of the art, The stable marriage problem: an interdisciplinary review from the physicist's perspective, Travelling salesman problem tools for microcomputers, Personnel placement in a fuzzy environment, Tolerance-based branch and bound algorithms for the ATSP, Lower tolerance-based branch and bound algorithms for the ATSP, Iterative patching and the asymmetric traveling salesman problem, An addendum on the incremental assignment problem, Authors' response to ``An addendum on the incremental assignment problem by Volgenant, Speeding up the Hungarian algorithm, ThIEF: Finding Genome-wide Trajectories of Epigenetics Marks, Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems, Kalman filtering with censored measurements, A comprehensive simplex-like algorithm for network optimization and perturbation analysis

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