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

Maximilian Thiessen,Luis Quesada,Kenneth N. Brown

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

2020

Maximilian Thiessen
Luis Quesada
Kenneth N. Brown

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)

Keywords:

Branch and bound
Local search (optimization)
Library science
Scholarship
German
Minimum spanning tree
Computer science
european commission

Correction
Source
Cite
Save
Machine Reading By IdeaReader

References

Citations