Improved polynomial algorithms for robust bottleneck problems with interval data (Q1046706)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5651578
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved polynomial algorithms for robust bottleneck problems with interval data |
scientific article; zbMATH DE number 5651578 |
Statements
Improved polynomial algorithms for robust bottleneck problems with interval data (English)
0 references
22 December 2009
0 references
minmax regret
0 references
bottleneck criterion
0 references
interval data
0 references
sequencing
0 references
0 references
0 references
0 references
0 references
0.8060676455497742
0 references
0.7700063586235046
0 references
0.7589890360832214
0 references
0.7589890360832214
0 references
0.7577835321426392
0 references
