| 来源类型 | Monograph (IIASA Working Paper) |
| 规范类型 | 论文 |
| An Algorithm for Commodity Distribution Among Two Kinds of Transportation Possibly to be Used in the Silistra Region Project. | |
| Mihailov B | |
| 发表日期 | 1978 |
| 出版者 | IIASA, Laxenburg, Austria: WP-78-043 |
| 出版年 | 1978 |
| 语种 | 英语 |
| 摘要 | This algorithm is a modified Ford-Fulkerson method for the shortest distance in a set, in which the transformed transportation costs are used instead of the transportation distance. For this purpose a set of commodity destinations serves as a basis for sketching of the sections and crosspoints of the two transports. It is supposed that there is no friction limitation and the initial, final, surcharge and transit operation expenditures are assigned. |
| 主题 | General Research (GEN) |
| URL | http://pure.iiasa.ac.at/id/eprint/868/ |
| 来源智库 | International Institute for Applied Systems Analysis (Austria) |
| 资源类型 | 智库出版物 |
| 条目标识符 | http://119.78.100.153/handle/2XGU8XDN/121580 |
| 推荐引用方式 GB/T 7714 | Mihailov B. An Algorithm for Commodity Distribution Among Two Kinds of Transportation Possibly to be Used in the Silistra Region Project.. 1978. |
| 条目包含的文件 | ||||||
| 文件名称/大小 | 资源类型 | 版本类型 | 开放类型 | 使用许可 | ||
| WP-78-043.pdf（121KB） | 智库出版物 | 限制开放 | CC BY-NC-SA | 浏览 | ||
| 个性服务 |
| 推荐该条目 |
| 保存到收藏夹 |
| 导出为Endnote文件 |
| 谷歌学术 |
| 谷歌学术中相似的文章 |
| [Mihailov B]的文章 |
| 百度学术 |
| 百度学术中相似的文章 |
| [Mihailov B]的文章 |
| 必应学术 |
| 必应学术中相似的文章 |
| [Mihailov B]的文章 |
| 相关权益政策 |
| 暂无数据 |
| 收藏/分享 |
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。
