Minimax regret vertex centdian location problem in general dynamic networks

Hongmei Li,Taibo Luo,Yinfeng Xu,Jiuping Xu

Omega（2018）

引用 3|浏览6

暂无评分

摘要

•Considered the minimax regret vertex centdian location problem in dynamic general networks.•Presented an O(n3log n) time algorithm to solve the problem.•Reported several numerical examples which reflected the properties of parameter λ1.

查看译文

关键词

Centdian location,General network,Minimax regret,Algorithm

AI 理解论文

溯源树

样例

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

Chat Paper

正在生成论文摘要