A rearrangement inequality for the longest run, with an application to network reliability (Q3678429)
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 3899908
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A rearrangement inequality for the longest run, with an application to network reliability |
scientific article; zbMATH DE number 3899908 |
Statements
A rearrangement inequality for the longest run, with an application to network reliability (English)
0 references
1985
0 references
rearrangement inequality
0 references
optimal permutation problem
0 references
0.853219211101532
0 references
0.7474685907363892
0 references
0.7259389758110046
0 references