An Algorithm for the Three-Index Assignment Problem (Q3981514): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Normalize DOI. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1287/opre.39.1.150 / rank | |||
| 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/opre.39.1.150 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2006743657 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1287/OPRE.39.1.150 / rank | |||
Normal rank | |||
Latest revision as of 21:05, 28 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Algorithm for the Three-Index Assignment Problem |
scientific article |
Statements
An Algorithm for the Three-Index Assignment Problem (English)
0 references
26 June 1992
0 references
branch-and-bound
0 references
axial three-index assignment
0 references
polyhedral combinatorics
0 references
Lagrangian relaxation
0 references
approximation
0 references
