Speeding up the Hungarian algorithm
From MaRDI portal
Publication:1823856
DOI10.1016/0305-0548(90)90031-2zbMath0681.90057OpenAlexW2064608681MaRDI QIDQ1823856
Publication date: 1990
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(90)90031-2
Numerical mathematical programming methods (65K05) Integer programming (90C10) Linear programming (90C05) Boolean programming (90C09)
Related Items (3)
Index Matrices as a Cost Optimization Tool of Resource Provisioning in Uncertain Cloud Computing Environment ⋮ A BRANCH-AND-BOUND ALGORITHM FOR FINDING ALL OPTIMAL SOLUTIONS OF THE ASSIGNMENT PROBLEM ⋮ The stable marriage problem: an interdisciplinary review from the physicist's perspective
Cites Work
This page was built for publication: Speeding up the Hungarian algorithm