A labeling algorithm to solve the assignment problem
type: Item
instance of: scholarly article
title: A labeling algorithm to solve the assignment problem
zbMATH Open document ID: 0679.90042
DOI: 10.1016/0305-0548(89)90028-2
author: Vahid Lotfi
published in: Computers \& Operations Research
publication date: 1989-01-01T00:00:00Z
review text: This paper describes a simple labeling algorithm to solve the assignment problem. The labeling approach is based on the maximum-flow formulation of the problem of finding the fewest number of lines to cover all zeros in the reduced assignment matrix. The approach is useful for educational purposes as well as programming environments. The labeling procedure can be used without requiring familiarity with the maximum-flow problem.
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C09
zbMATH DE Number: 4114375
zbMATH Keywords: Hungarian method
zbMATH Keywords: labeling algorithm
zbMATH Keywords: assignment
zbMATH Keywords: maximum-flow formulation
reviewed by: Rainer Beedgen
MaRDI profile type: Publication
full work available at URL: 0305-0548(89)90028-2
OpenAlex ID: W2085014560
cites work: Q5519710
cites work: Q4131953
cites work: Q4739657
cites work: Q4673630
description: scientific article; zbMATH DE number 4114375