Chance-Constrained Programming Models and Approximations for General Stochastic Bottleneck Spanning Tree Problems (Q3466775): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:58, 4 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Chance-Constrained Programming Models and Approximations for General Stochastic Bottleneck Spanning Tree Problems |
scientific article |
Statements
Chance-Constrained Programming Models and Approximations for General Stochastic Bottleneck Spanning Tree Problems (English)
0 references
25 January 2016
0 references
stochastic bottleneck spanning tree
0 references
chance-constrained programming
0 references
special ordered sets
0 references
bisection algorithm
0 references
NP-complete
0 references
