A new formulation for spanning trees

DOI10.1016/J.ENDM.2011.05.034zbMATH Open1268.05213OpenAlexW2048262212MaRDI QIDQ2840708FDOQ2840708

Authors: Sebastián Urrutia, Abilio Lucena 

Publication date: 23 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2011.05.034

Recommendations

• Constraint Programming for the Diameter Constrained Minimum Spanning Tree Problem
• Solving diameter-constrained minimum spanning tree problems by constraint programming
• Integer programming formulations for minimum spanning forests and connected components in sparse graphs
• The tree-star problem: a formulation and a branch-and-cut algorithm
• A new relaxation method for the generalized minimum spanning tree problem

zbMATH Keywords

spanning treesinteger programing

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Integer programming (90C10)

Cites Work

• Title not available (Why is that?)
• Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
• Matroids and the greedy algorithm

Cited In (6)

• Characterizing acyclic graphs by labeling edges
• Constraint Programming for the Diameter Constrained Minimum Spanning Tree Problem
• Integer programming formulations for minimum spanning forests and connected components in sparse graphs
• Mixed-integer programming approaches for the tree \(t^*\)-spanner problem
• Title not available (Why is that?)
• Emerging spanning trees in the work of Candilis-Josic-Woods

This page was built for publication: A new formulation for spanning trees

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