节点文献
求解非减上模集函数最小值问题的近似算法及其性能保证
An Approximation Algorithm and Its Performance Guarantee for Minimizing Non-decreasing Supermodular Set Function
【摘要】 上模集函数的优化问题在组合优化问题中有广泛应用,许多组合优化问题,如设备选址问题、p-中心问题等都可化为上模集函数的优化问题.本文给出了求解非减上模集函数最小值问题的一种近似算法,并讨论了所给算法的性能保证.
【Abstract】 Maximizing or minimizing supermodular set function has a wide range of applications in combinatorial optimization problem.Many combinatorial optimization problems including equipment site selection or p-median problem can be translated into the supermodular set function’s optimization problems.In this paper,an approximation algorithm for minimizing non-decreasing supermodular set function is presented,and its performance guarantee is discussed.
【关键词】 组合优化问题;
上模集函数;
近似算法;
性能保证;
【Key words】 combinatorial optimization problem; supermodular set function; approximation algorithm; performance guarantee;
【Key words】 combinatorial optimization problem; supermodular set function; approximation algorithm; performance guarantee;
【基金】 国家自然科学基金项目(10901004);北方民族大学基础研究计划项目
- 【文献出处】 数学的实践与认识 ,Mathematics in Practice and Theory , 编辑部邮箱 ,2012年24期
- 【分类号】O224
- 【下载频次】58