An exact and heuristic approach for the \(d\)-minimum branch vertices problem

DOI10.1007/s10589-018-0027-xzbMath1416.90054MaRDI QIDQ1756586

Xianqiang Yang

Publication date: 21 December 2018

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-018-0027-x

zbMATH Keywords

integer programming; spanning tree; metaheuristic; branch vertice

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C10: Integer programming

90C59: Approximation methods and heuristics in mathematical programming