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

DOI10.1007/978-3-030-58942-4_29OpenAlexW3091103485MaRDI QIDQ2110436

Maximilian Thiessen, Luis O. Quesada, Kenneth N. Brown

Publication date: 21 December 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-58942-4_29

zbMATH Keywords

branch-and-boundlocal searchdegree-constrained minimum spanning treeLKH

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Operations research and management science (90Bxx)

This page was built for publication: Improving a branch-and-bound approach for the degree-constrained minimum spanning tree problem with LKH