Multimode extensions of Combinatorial Optimization problems.

Electronic Notes in Discrete Mathematics（2016）

引用 0|浏览20

暂无评分

摘要

We review some complexity results and present a viable heuristic approach based on the Variable Neighborhood Search (VNS) framework for multimode extension of combinatorial optimization problems, such as the the Set Covering Problem (SCP) and the Covering Location Problem (CLP).

查看译文

关键词

Combinatorial Optimization,covering problems,complexity,Variable Neighborhood Search

AI 理解论文

溯源树

样例

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

Chat Paper

正在生成论文摘要