期刊
4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH
卷 12, 期 4, 页码 373-378出版社
SPRINGER HEIDELBERG
DOI: 10.1007/s10288-014-0270-7
关键词
Robust combinatorial optimization; Discrete optimization
资金
- Chonbuk National University
Robust combinatorial optimization problems with cardinality constrained uncertainty may be solved by a finite number of nominal problems. In this paper, we show that the number of nominal problems to be solved can be reduced significantly.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据