Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A labeling algorithm to solve the assignment problem

From MaRDI portal
Publication:1823140
Jump to:navigation, search

DOI10.1016/0305-0548(89)90028-2zbMath0679.90042OpenAlexW2085014560MaRDI QIDQ1823140

Vahid Lotfi

Publication date: 1989

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(89)90028-2


zbMATH Keywords

assignmentlabeling algorithmHungarian methodmaximum-flow formulation


Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Deterministic network models in operations research (90B10) Boolean programming (90C09)


Related Items (2)

A new algorithm for the assignment problem: An alternative to the Hungarian method ⋮ Personnel placement in a fuzzy environment



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item


This page was built for publication: A labeling algorithm to solve the assignment problem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1823140&oldid=14186212"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 10:49.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki