Lower and upper bounds for the spanning tree with minimum branch vertices
type: Item
instance of: scholarly article
title: Lower and upper bounds for the spanning tree with minimum branch vertices
zbMATH Open document ID: 1312.90038
author: Francesco Carrabs
author: Raffaele Cerulli
author: Manlio Gaudioso
author: Monica Gentili
published in: Computational Optimization and Applications
publication date: 2013-11-07T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C56
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 6223470
zbMATH Keywords: spanning tree
zbMATH Keywords: Lagrangian relaxation
zbMATH Keywords: dual ascent
MaRDI profile type: Publication
full work available at URL: s10589-013-9556-5
OpenAlex ID: W2022130029
cites work: Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints
cites work: New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints
cites work: Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations
cites work: Spanning trees with many or few colors in edge-colored graphs
cites work: Q4737170
cites work: Bounded-degree spanning tree problems: models and new algorithms
cites work: Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
cites work: An Incremental Method for Solving Convex Finite Min-Max Problems
cites work: On solving the Lagrangian dual of integer programs via an incremental approach
cites work: Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
cites work: A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
cites work: Q4845371
cites work: Q4273942
cites work: Q3056948
cites work: Q4943600
DOI: 10.1007/S10589-013-9556-5
description: scientific article; zbMATH DE number 6223470