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!
|
| id |
my.upm.eprints.114136 |
|---|---|
| record_format |
eprints |
| spelling |
my.upm.eprints.1141362024-12-10T01:50:21Z http://psasir.upm.edu.my/id/eprint/114136/ Interval elimination method for stochastic spanning tree problem Mohd, Ismail 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. 1994 Article PeerReviewed text en http://psasir.upm.edu.my/id/eprint/114136/1/114136.pdf Mohd, Ismail (1994) Interval elimination method for stochastic spanning tree problem. Applied Mathematics and Computation, 66 (2-3). pp. 325-341. ISSN 0096-3003; eISSN: 0096-3003 https://linkinghub.elsevier.com/retrieve/pii/0096300394901260 10.1016/0096-3003(94)90126-0 |
| institution |
Universiti Putra Malaysia |
| building |
UPM Library |
| collection |
Institutional Repository |
| continent |
Asia |
| country |
Malaysia |
| content_provider |
Universiti Putra Malaysia |
| content_source |
UPM Institutional Repository |
| url_provider |
http://psasir.upm.edu.my/ |
| language |
English |
| description |
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. |
| format |
Article |
| author |
Mohd, Ismail |
| spellingShingle |
Mohd, Ismail Interval elimination method for stochastic spanning tree problem |
| author_facet |
Mohd, Ismail |
| author_sort |
Mohd, Ismail |
| title |
Interval elimination method for stochastic spanning tree problem |
| title_short |
Interval elimination method for stochastic spanning tree problem |
| title_full |
Interval elimination method for stochastic spanning tree problem |
| title_fullStr |
Interval elimination method for stochastic spanning tree problem |
| title_full_unstemmed |
Interval elimination method for stochastic spanning tree problem |
| title_sort |
interval elimination method for stochastic spanning tree problem |
| publishDate |
1994 |
| url |
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 |
| _version_ |
1818835920288219136 |
| score |
13.23648 |