Interval elimination method for stochastic spanning tree problem
The optimum spanning tree problem has been well considered and until now several powerful algorithms have been proposed. This problem has been generalized toward a stochastic spanning tree problem in which edge weights are not constant but random variables. A method called an interval elimination is...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
1994
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/114136/1/114136.pdf http://psasir.upm.edu.my/id/eprint/114136/ https://linkinghub.elsevier.com/retrieve/pii/0096300394901260 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | The optimum spanning tree problem has been well considered and until now several powerful algorithms have been proposed. This problem has been generalized toward a stochastic spanning tree problem in which edge weights are not constant but random variables. A method called an interval elimination is used for solving the stochastic spanning tree problem which has been transformed into its proxy deterministic equivalent problem. © 1994. |
|---|