Speeding up the Hungarian algorithm

DOI10.1016/0305-0548(90)90031-2zbMath0681.90057OpenAlexW2064608681MaRDI QIDQ1823856

Yanyan Li

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

zbMATH Keywords

Hungarian algorithmlinear assignment

Mathematics Subject Classification ID

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

• Unnamed Item
• Improving the Hungarian assignment algorithm
• A shortest augmenting path algorithm for dense and sparse linear assignment problems
• Applying Stochastic Algorithms to a Locomotive Scheduling Problem
• Solving the Assignment Problem by Relaxation

This page was built for publication: Speeding up the Hungarian algorithm