Speeding up the Hungarian algorithm
type: Item
instance of: scholarly article
title: Speeding up the Hungarian algorithm
zbMATH Open document ID: 0681.90057
DOI: 10.1016/0305-0548(90)90031-2
author: Yanyan Li
published in: Computers \& Operations Research
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C09
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 4116302
zbMATH Keywords: Hungarian algorithm
zbMATH Keywords: linear assignment
MaRDI profile type: Publication
full work available at URL: 0305-0548(90)90031-2
OpenAlex ID: W2064608681
cites work: Q5519710
cites work: Solving the Assignment Problem by Relaxation
cites work: A shortest augmenting path algorithm for dense and sparse linear assignment problems
cites work: Improving the Hungarian assignment algorithm
cites work: Applying Stochastic Algorithms to a Locomotive Scheduling Problem
description: scientific article; zbMATH DE number 4116302