Exact algorithms for finding constrained minimum spanning trees
type: Item
instance of: scholarly article
title: Exact algorithms for finding constrained minimum spanning trees
zbMATH Open document ID: 1502.90185
author: Pei Yao
author: Longkun Guo
published in: Journal of Combinatorial Optimization
publication date: 2022-10-04T00:00:00Z
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 7595934
zbMATH Keywords: constrained minimum spanning tree
zbMATH Keywords: bicameral edge replacement
zbMATH Keywords: local search
MaRDI profile type: Publication
full work available at URL: s10878-020-00579-z
OpenAlex ID: W3023896539
cites work: Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem
cites work: Minimum-weight degree-constrained spanning tree problem: Heuristics and implementation on an SIMD parallel machine
cites work: The 2-hop spanning tree problem
cites work: An Efficient Polynomial Time Approximation Scheme for the Constrained Minimum Spanning Tree Problem Using Matroid Intersection
cites work: A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem.
cites work: Combinatorial optimization. Theory and algorithms.
cites work: On the shortest spanning subtree of a graph and the traveling salesman problem
cites work: Bicriteria Network Design Problems
cites work: The constrained minimum spanning tree problem
DOI: 10.1007/S10878-020-00579-Z
description: scientific article; zbMATH DE number 7595934