A Lower Bound on the Expected Cost of an Optimal Assignment (Q5287981): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/moor.18.2.267 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2142946851 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 22:00, 19 March 2024
scientific article; zbMATH DE number 243320
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Lower Bound on the Expected Cost of an Optimal Assignment |
scientific article; zbMATH DE number 243320 |
Statements
A Lower Bound on the Expected Cost of an Optimal Assignment (English)
0 references
5 August 1993
0 references
lower bound
0 references
dual heuristic algorithm
0 references
optimal assignment
0 references
