Gateway to Think Tanks
来源类型 | Monograph (IIASA Working Paper) |
规范类型 | 论文 |
The A-Forest Iteration Method for the Stochastic Generalized Transportation Problem. | |
Qi L | |
发表日期 | 1984 |
出版者 | IIASA, Laxenburg, Austria: WP-84-058 |
出版年 | 1984 |
语种 | 英语 |
摘要 | The stochastic generalized transportation problem (SGTP) has an optimal solution: each of the connected subgraphs of its graph is either a tree or a one-loop tree. We call such a graph an A-forest. We propose here a finitely convergent method, the A-forest iteration method, to solve the SGTP. It iterates from one base A-forest triple to another base A-Forest triple. The iteration techniques constitute some modifications of those for the first iteration method for solving the stochastic transportation problem (STP), which was given in L Qi (1983), "Forest iteration method For stochastic transportation problem" (Comp. Sci. Tech. Rept. #522. University of Wisconsin-Madison). Sensitivity Analysis and numerical examples are also given. |
主题 | Adaption and Optimization (ADO) |
URL | http://pure.iiasa.ac.at/id/eprint/2460/ |
来源智库 | International Institute for Applied Systems Analysis (Austria) |
资源类型 | 智库出版物 |
条目标识符 | http://119.78.100.153/handle/2XGU8XDN/123027 |
推荐引用方式 GB/T 7714 | Qi L. The A-Forest Iteration Method for the Stochastic Generalized Transportation Problem.. 1984. |
条目包含的文件 | ||||||
文件名称/大小 | 资源类型 | 版本类型 | 开放类型 | 使用许可 | ||
WP-84-058.pdf(827KB) | 智库出版物 | 限制开放 | CC BY-NC-SA | 浏览 |
个性服务 |
推荐该条目 |
保存到收藏夹 |
导出为Endnote文件 |
谷歌学术 |
谷歌学术中相似的文章 |
[Qi L]的文章 |
百度学术 |
百度学术中相似的文章 |
[Qi L]的文章 |
必应学术 |
必应学术中相似的文章 |
[Qi L]的文章 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。