期刊文献+

求解预支约束下商品批发零售问题的近似算法 被引量:1

A New Approximation Algorithm for Wholesale-retail Problem
下载PDF
导出
摘要 研究了求解预支约束下批发零售问题的一种新的近似算法,这一算法是一种改进的贪婪算法,即将部分穷举法与贪婪算法相结合并从理论上分析了该算法的可靠性和有效性,最后得出了该算法的性能保证为1-e-1. 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.
出处 《兰州交通大学学报》 CAS 2009年第6期138-140,共3页 Journal of Lanzhou Jiaotong University
关键词 预支约束 下模函数 近似算法 性能保证 budgeted constraint submodular function approximation algorithm performance guarantee
  • 相关文献

参考文献5

  • 1Nemhauser G L,Wolsey L A, Fisher M L. An analysis of approximations for maximizing submodular set functions-I[J]. Mathematical Programming, 1978(14) : 265- 294.
  • 2Samir K, Anna M, J osepf N. Budgeted maximum coverage problem[J]. Information Processing Letters, 1999, 70(1) : 39.
  • 3Sviridenko M. A note on maximizing a submodular set function subject to knapsack eontraint[J]. Operation Rrdrstvhi Lryyrtd,2004(32) :41-43.
  • 4Chandra C, Amit K. Maximum coverage problem with group budget constraints and applications[J]. Lecture Notes in Computer Science, 2004,12 (2) : 72-83.
  • 5Fulishige S. Submodular functions and optimization [M]. Amsterdam: Elserier Science, 2005.

同被引文献11

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部