A Shortest Augmenting Path Algorithm for the Semi-Assignment Problem (Q3991331): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/opre.40.1.178 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2088009736 / rank | |||
Normal rank | |||
Revision as of 21:16, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Shortest Augmenting Path Algorithm for the Semi-Assignment Problem |
scientific article |
Statements
A Shortest Augmenting Path Algorithm for the Semi-Assignment Problem (English)
0 references
28 June 1992
0 references
shortest augmenting path algorithm
0 references
semi-assignment problem
0 references
