首页 | 本学科首页   官方微博 | 高级检索  
     检索      

求解预支约束下商品批发零售问题的近似算法
引用本文:罗亮,魏万喜,贾欣鑫,何尚录.求解预支约束下商品批发零售问题的近似算法[J].兰州铁道学院学报,2009,28(6):138-140.
作者姓名:罗亮  魏万喜  贾欣鑫  何尚录
作者单位:[1]兰州交通大学数理与软件工程学院,甘肃兰州730070 [2]皋兰县教育局,甘肃兰州730200
摘    要:研究了求解预支约束下批发零售问题的一种新的近似算法,这一算法是一种改进的贪婪算法,即将部分穷举法与贪婪算法相结合并从理论上分析了该算法的可靠性和有效性,最后得出了该算法的性能保证为1-e-1.

关 键 词:预支约束  下模函数  近似算法  性能保证

A New Approximation Algorithm for Wholesale-retail Problem
LUO Liang,WEI Wan-xi,JIA Xin-xin,HE Shang-lu.A New Approximation Algorithm for Wholesale-retail Problem[J].Journal of Lanzhou Railway University,2009,28(6):138-140.
Authors:LUO Liang  WEI Wan-xi  JIA Xin-xin  HE Shang-lu
Institution:LUO Liang, WEI Wan-xi, JIA Xin-xin, HE Shang-lu(1.School of Mathematics, Physics and Softwa re Engineering, Ianzhou Jiaotong University, Lanzhou 730070, China 2. Local Edueation Authority of Gaolan, Lanzhou 730200,China)
Abstract:A new approximation algorithm is presented for wholesale-retail problem.The algorithm is an improved greedy algorithm which combines the part of enumeration method with the greedy algorithm.At the same time,the reliability and effect of this algorithm are theoretically proved.Finially,it is presented that the algorithm has 1-e-1 performance guarantee for this problem.
Keywords:budgeted constraint  submodular function  approximation algorithm  performance guarantee
本文献已被 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号