A new implementation of an algorithm for the optimal assignment problem: An improved version of Munkres' algorithm (Q3048271): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algorithms for the Assignment and Transportation Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An algorithm for the assignment problem / rank | |||
Normal rank | |||
Latest revision as of 02:57, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new implementation of an algorithm for the optimal assignment problem: An improved version of Munkres' algorithm |
scientific article |
Statements
A new implementation of an algorithm for the optimal assignment problem: An improved version of Munkres' algorithm (English)
0 references
1979
0 references
optimal assignment problem
0 references
worst-case time
0 references
analysis of algorithms
0 references
computational complexity
0 references
network flow
0 references
