An optimal algorithm for \(2 \times{} n\) bottleneck transportation problems (Q1186949)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An optimal algorithm for \(2 \times{} n\) bottleneck transportation problems |
scientific article; zbMATH DE number 37368
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An optimal algorithm for \(2 \times{} n\) bottleneck transportation problems |
scientific article; zbMATH DE number 37368 |
Statements
An optimal algorithm for \(2 \times{} n\) bottleneck transportation problems (English)
0 references
28 June 1992
0 references
divide-and-conquer
0 references
Bottleneck transportation
0 references
optimal algorithm
0 references
0 references
0 references
0.9350596
0 references
0.9178859
0 references
0.89346457
0 references
0.8892865
0 references
0.8841231
0 references
