The three dimensional bottleneck assignment problem and its variants (Q3690581): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (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.1080/02331938508843013 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2000506209 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A bilinear programming formulation of the 3-dimensional assignment problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the bottleneck assignment problem / rank | |||
Normal rank | |||
Latest revision as of 17:40, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The three dimensional bottleneck assignment problem and its variants |
scientific article |
Statements
The three dimensional bottleneck assignment problem and its variants (English)
0 references
1985
0 references
bi-linear programming
0 references
three-dimensional bottleneck assignment
0 references
optimal solution
0 references
