Reformulation by Intersection Method on the MST Problem with Lower Bound on the Number of Leaves
From MaRDI portal
Publication:3091486
DOI10.1007/978-3-642-21527-8_11zbMath1345.90093MaRDI QIDQ3091486
Publication date: 9 September 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-21527-8_11
90C35: Programming involving graphs or networks
Related Items
The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm, Spanning trees with a constraint on the number of leaves. A new formulation, Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: complexity, properties and formulations