Stochastic spanning tree problem (Q1155516): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Chance-Constrained Programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4083324 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A good algorithm for smallest spanning trees with a degree constraint / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Stochastic Programming Model / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the shortest spanning subtree of a graph and the traveling salesman problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Recursive constraints and stochastic linear programming / rank | |||
Normal rank | |||
Latest revision as of 13:30, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Stochastic spanning tree problem |
scientific article |
Statements
Stochastic spanning tree problem (English)
0 references
1981
0 references
minimal spanning tree problem
0 references
stochastic spanning tree
0 references
polynomial order algorithm
0 references
discrete stochastic programming
0 references
communication network
0 references
random edge costs
0 references
