Speeding up the Hungarian algorithm (Q1823856): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0305-0548(90)90031-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2064608681 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5519710 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Solving the Assignment Problem by Relaxation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A shortest augmenting path algorithm for dense and sparse linear assignment problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Improving the Hungarian assignment algorithm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Applying Stochastic Algorithms to a Locomotive Scheduling Problem / rank | |||
Normal rank | |||
Latest revision as of 10:48, 20 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Speeding up the Hungarian algorithm |
scientific article |
Statements
Speeding up the Hungarian algorithm (English)
0 references
1990
0 references
Hungarian algorithm
0 references
linear assignment
0 references
