| 具有全局性公平满意度的最大多物资网络流问题 |
| |
| 引用本文： | 程丛电,李振鹏.具有全局性公平满意度的最大多物资网络流问题[J].应用数学学报,2011,34(3). |
| |
| 作者姓名： | 程丛电 李振鹏 |
| |
| 作者单位： | 1. 沈阳师范大学数学与系统科学学院,沈阳,110034
2. 中国科学院数学与系统科学研究院系统科学研究所,北京,100190 |
| |
| 摘 要： | 我们研究-个具有全局性公平满意度的最大多物资网络流问题(MMFP-GFMR).该项工作不仅丰富了最大多物资网络流问题的内容,而且可用于研究某些实际优化决策问题,例如运输过程中的一些资源分配问题.文中主要内容如下:(A)定义问题MMFP-GFMR并证明其解的存在性.(B)设计-个求解MMFP-GFMR的拟多项式逼近算法.(C)研究算法的复杂性与逼近程度.(D)最后通过模拟计算验证了我们的工作.
|
| 关 键 词： | 网络 多物资网络流 资源分配 最优决策 逼近算法 逼近程度 |
Maximum Multicommodity Flow Problem with Global Fair Met Rate |
| |
| CHENG CONGDIAN,LI ZHENPENG.Maximum Multicommodity Flow Problem with Global Fair Met Rate[J].Acta Mathematicae Applicatae Sinica,2011,34(3). |
| |
| Authors: | CHENG CONGDIAN LI ZHENPENG |
| |
| Institution: | CHENG CONGDIAN (College of Mathematics and Systems Science,Shenyang Normal University,Shenyang 110034) LI Zhenpeng (Institute of Systems Science,Academy of Mathematics and Systems Science |
| |
| Abstract: | The present work studies a maximum multicommodity flow problem with global fair met rate,which not only enriches the content of the maximum multicommodity flow problem,but also can be used to study the optimization decisions of some practical problems, such as the operations of logistics distribution stemming out of transportation.The major contributions are as follows:(A) Propose the problem and prove its solutions exists.(B) Design a pseudopolynomial approximation algorithm to solve the problem.(C) Propos... |
| |
| Keywords: | network multicommodity flow logistics distribution optimization decision approximation algorithm approximation measure |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
