On the weight-constrained minimum spanning tree problem

DOI10.1007/978-3-642-21527-8_20MaRDI QIDQ3091497zbMATH OpenOpenAlexWikidataFDO

Authors Agostinho Agra, Adelaide Cerveira, Cristina Requejo, Eulália Santos

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_20

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• The minimum weight spanning tree with constraints
• Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints
• A branch and cut method for the degree-constrained minimum spanning tree problem
• Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
• The Weighted Spanning Tree Constraint Revisited

Cited in

(11)

• Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem
• Valid inequalities for non-unit demand capacitated spanning tree problems with flow costs
• On type-2 fuzzy weighted minimum spanning tree
• Implicit cover inequalities
• The Minimum Spanning Tree Constraint
• The Weighted Spanning Tree Constraint Revisited
• Estimating the Weight of Metric Minimum Spanning Trees in Sublinear Time
• New valid inequalities for the optimal communication spanning tree problem
• Minimum-weight spanning tree algorithms. A survey and empirical study
• Minimum weight clustered dominating tree problem
• Minimum spanning trees in networks with varying edge weights

This page was built for publication: On the weight-constrained minimum spanning tree problem

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