Formulations and exact solution approaches for the degree preserving spanning tree problem

DOI10.1002/NET.21590zbMATH Open1388.05041OpenAlexW2082259377MaRDI QIDQ4565764FDOQ4565764

Authors:

Publication date: 13 June 2018

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21590

Recommendations

• Degree-preserving spanning trees in small-degree graphs
• scientific article; zbMATH DE number 1563034
• scientific article; zbMATH DE number 1420489
• Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem
• scientific article; zbMATH DE number 1222606

zbMATH Keywords

spanning treesbranch-and-cutLagrangian relaxationbenders decompositionvertex feedback edge set problem

Mathematics Subject Classification ID

Trees (05C05) Vertex degrees (05C07) Connectivity (05C40)

Cited In (2)

• The degree-preserving spanning tree problem in strongly chordal and directed path graphs
• Decomposition methods based on articulation vertices for degree-dependent spanning tree problems

This page was built for publication: Formulations and exact solution approaches for the degree preserving spanning tree problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4565764)