Rankings
Publications
Search Publications
Cited-by Search
Sources
Publishers
Scholars
Scholars
Top Cited Scholars
Organizations
About
Scilit
About Us
Advisory Board
Data Sources
Career
Support / Contact
User Guide
Publisher User
Search Function
Rankings Function
API Resource
Scilit Knowledge
Metrics
Scilit Recognitions
Publications Classification
Media
News
Blog
Login
Register
Home
Publications
Technical Note—A “Hard” Assignment Problem
Home
Publications
Technical Note—A “Hard” Assignment Problem
Technical Note—A “Hard” Assignment Problem
Authors:
RM
Robert E. Machol
Robert E. Machol
MW
Michael Wien
Michael Wien
Article Alert
Citation Alert
Add to Library
Cite
Download
Share
Download
Publisher website
Google Scholar
1 February 1976
journal article
Published by
Institute for Operations Research and the Management Sciences (INFORMS)
in
Operations Research
Vol. 24
(1)
,
190-192
DOI:
10.1287/opre.24.1.190
Abstract
We construct numerical examples that force Hungarian-method algorithms for the assignment problem to their worst-case time bounds. These bounds are thereby clarified.
Keywords
HARD
CLARIFIED
WORST
ASSIGNMENT PROBLEM
TECHNICAL NOTE
FORCE HUNGARIAN
Related articles
Cited
Cited by 11 articles
Scroll to top