Improving a branch-and-bound approach for the degree-constrained minimum spanning tree problem with LKH

Maximilian Thiessen,Luis Quesada, Kenneth N. Brown

Lecture Notes in Computer Science（2020）

引用 1|浏览13

暂无评分

摘要

Science Foundation Ireland; Chist-ERA project Dyposit (16/SP/3804 and 12/RC/2289 P2 Chist-ERA project Dyposit); European Commission and Enterprise Ireland (grant IR 2017 0041/ EU 737422-2 SCOTT); Studienstiftung des Deutschen Volkes (German Academic Scholarship Foundation)

查看译文

关键词

Degree-constrained minimum spanning tree, Branch-and-bound, Local search, LKH

AI 理解论文

溯源树

样例

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

Chat Paper

正在生成论文摘要