Computational Evaluation of Greedy Heuristic Methods for 2-objective MMSCP

Qiwei SUN,Toshiyuki MIYAMOTO,Shoichi KITAMURA,Ayako TANIGUCHI-MATSUOKA, Kento NAITO,Kazuyuki MORI, Yoshio IZUI

2021 IEEE International Conference on Consumer Electronics (ICCE)（2021）

引用 0|浏览2

暂无评分

摘要

The set cover problem, which is a classical question in combinatorial optimization, is known to be NP-hard and has been studied by many researchers. We proposed the 2-objective min-max set multi-cover problem and applied the greedy heuristic method to the problem. In this paper, the performance of the method is evaluated on the clearing problem of reserve market.

查看译文

关键词

min-max problem,set multi-cover problem,greedy solution

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要