Reformulation by Intersection Method on the MST Problem with Lower Bound on the Number of Leaves

DOI10.1007/978-3-642-21527-8_11zbMath1345.90093OpenAlexW146718476MaRDI QIDQ3091486

João Telhada, Luís Gouveia

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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (3)

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 ⋮ The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm

This page was built for publication: Reformulation by Intersection Method on the MST Problem with Lower Bound on the Number of Leaves