.png){kind=icon}
返回
A randomized algorithm for the min-max selecting items problem with uncertain weights
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-009-0564-x.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper deals with the min-max version of the problem of selecting p items of the minimum total weight out of a set of n items, where the item weights are uncertain. The discrete scenario representation of uncertainty is considered. The Computational complexity of the problem is explored. A randomized algorithm for the problem is then proposed, which returns an O(ln K)-approximate Solution with a high probability, where K is the number of scenarios. This is the first approximation algorithm with better than K worst case ratio for the class of min-max combinatorial optimization problems with unbounded scenario set.
Keyword:
Minmax
Selecting items
Randomized algorithm
Robust optimization
期刊
IF:
4.5
论文数:
8.0K
被引数:
2.1W
机构
引用论文
Effects of Group Counseling Transmitted Through Videoconferencing on Changes in Eating Behaviors
PREAI
分享收藏Periostin plays a key role in maintaining the osteogenic abilities of dental follicle stem cells in the inflammatory microenvironmentPeriostin在炎症微环境中对维持牙囊干细胞成骨能力发挥关键作用。
PREAI
分享收藏Analysis of coherent laser echo characteristics back scattered from rough Gaussian target.png)
Optik
OptikIF0
PREAI
分享收藏Synthesis, X-ray characterization, DFT calculations and Hirshfeld surface analysis studies of carbohydrazone based on Zn(ii) complexesCrystEngComm
CrystEngCommIF0
PREAI
分享收藏Approximation of min-max and min-max regret versions of some combinatorial optimization problems某些组合优化问题的min-max和min-max后悔版本的逼近
OAAI
OAAI分享收藏
查看更多内容