A rearrangement inequality for the longest run, with an application to network reliability (Q3678429): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user 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.2307/3213781 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2320173905 / rank | |||
Normal rank | |||
Latest revision as of 14:28, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A rearrangement inequality for the longest run, with an application to network reliability |
scientific article |
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
