Citation
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
Abstract
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.
Download File
Official URL or Download Paper: https://linkinghub.elsevier.com/retrieve/pii/00963...
|
![[img]](http://psasir.upm.edu.my/style/images/fileicons/text.png)
Additional Metadata
| Item Type: | Article |
|---|---|
| Divisions: | Universiti Pertanian Malaysia |
| DOI Number: | https://doi.org/10.1016/0096-3003(94)90126-0 |
| Keywords: | Interval elimination method for stochastic spanning tree problem; Optimum spanning tree problem; Stochastic spanning tree problem |
| Depositing User: | Ms. Azian Edawati Zakaria |
| Date Deposited: | 10 Dec 2024 01:50 |
| Last Modified: | 10 Dec 2024 01:50 |
| Altmetrics: | http://www.altmetric.com/details.php?domain=psasir.upm.edu.my&doi=10.1016/0096-3003(94)90126-0 |
| URI: | http://psasir.upm.edu.my/id/eprint/114136 |
| Statistic Details: | View Download Statistic |
Actions (login required)
 |
View Item |