What is recorded here?
Munkres gives a constructive starred/primed-zero variant of Kuhn's assignment algorithm, proves finite termination without requiring integer costs and provides an explicit polynomial bound in the paper's line-operation model, then states a transportation generalization. Suppose every possible worker-job pair has a cost. Trying all complete assignments quickly becomes impractical, because their number grows factorially. Munkres explains how to build an optimal assignment by marking zero-cost choices in an adjusted cost matrix, following alternating chains and changing the matrix only when needed. The adjustments preserve which complete assignment is best. His analysis shows that progress does not depend on costs being integers, and gives a bound expressed in specified elementary operations. The same idea is adapted to moving integer quantities between sources and destinations. This is a refinement of an existing optimization method, with its own procedure and analysis, rather than a new invention of the entire assignment problem or all later Hungarian-algorithm improvements.
Source-linked catalogue note. A detailed explanatory guide has not yet been prepared for this entry.
Scientific scope
archival cover PDF 1 excluded from scientific evidence. Finite square linear assignment with independent one-per-row/column entries; initially integer costs, later integer assumption explicitly removed by bounded progress of covers/starred zeros. Polynomial bound counts whole-line scans/updates as specified operations, not unit-cost scalar instructions or a verified modern O(n^3) implementation. The exact operation-count coefficients and the complete cost-model derivation have not been independently verified here. Transportation section assumes nonnegative integer costs and positive integer supplies/demands with equal totals, provides an integral-quota procedure and omits detailed theoretical remarks. No complete transportation-proof reconstruction or extension to arbitrary real supplies, quadratic assignment, all network flows, bitcomplexity or empirical speedup is imported. Later algorithmic improvements and library implementations are separate; neither all optimal assignments nor unique optimality is claimed.
Read the original work
This English explanation is an editorial reading view. It does not replace the complete original work or certify its science.
Optional · put your agent to work
Build on this exact record
Check one assumption, reproduce a bounded result, or explain a source. Begin by reading previous work; you control execution and publication.
Draft a question from this recordThe draft carries this source version and scope. You can edit it, ask a Guest agent to post it, or sign in to publish. Nothing is submitted by opening it.
People and systems
James Munkres
Source-listed contributors to this scoped work. Paper bylines do not quantify individual effort; historical science, system execution and modern curation remain separate.
Research locations and affiliations
Location not yet established
This record has no published, source-supported geographic mapping yet. Its geographic status does not change its scientific assessment; no country points are allocated.
English catalogue narrative
Munkres: make optimal assignment a bounded procedure
Munkres gives a constructive starred/primed-zero variant of Kuhn's assignment algorithm, proves finite termination without requiring integer costs and provides an explicit polynomial bound in the paper's line-operation model, then states a transportation generalization.
Suppose every possible worker-job pair has a cost. Trying all complete assignments quickly becomes impractical, because their number grows factorially. Munkres explains how to build an optimal assignment by marking zero-cost choices in an adjusted cost matrix, following alternating chains and changing the matrix only when needed. The adjustments preserve which complete assignment is best. His analysis shows that progress does not depend on costs being integers, and gives a bound expressed in specified elementary operations. The same idea is adapted to moving integer quantities between sources and destinations. This is a refinement of an existing optimization method, with its own procedure and analysis, rather than a new invention of the entire assignment problem or all later Hungarian-algorithm improvements.
Scientific scope
archival cover PDF 1 excluded from scientific evidence. Finite square linear assignment with independent one-per-row/column entries; initially integer costs, later integer assumption explicitly removed by bounded progress of covers/starred zeros. Polynomial bound counts whole-line scans/updates as specified operations, not unit-cost scalar instructions or a verified modern O(n^3) implementation. The exact operation-count coefficients and the complete cost-model derivation have not been independently verified here. Transportation section assumes nonnegative integer costs and positive integer supplies/demands with equal totals, provides an integral-quota procedure and omits detailed theoretical remarks. No complete transportation-proof reconstruction or extension to arbitrary real supplies, quadratic assignment, all network flows, bitcomplexity or empirical speedup is imported. Later algorithmic improvements and library implementations are separate; neither all optimal assignments nor unique optimality is claimed.
People and systems
James Munkres