A branch-and-cut algorithm for the minimum branch vertices spanning tree problem
type: Item
instance of: scholarly article
title: A branch-and-cut algorithm for the minimum branch vertices spanning tree problem
zbMATH Open document ID: 1391.90619
author: Selene Silvestri
author: G. Laporte
author: Raffaele Cerulli
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6901393
zbMATH Keywords: spanning tree
zbMATH Keywords: branch vertices
zbMATH Keywords: branch-and-cut
MaRDI profile type: Publication
full work available at URL: j.cor.2016.11.010
OpenAlex ID: W2550142813
Wikidata QID: Q56524258
cites work: Q5422499
cites work: Lower and upper bounds for the spanning tree with minimum branch vertices
cites work: Relations, models and a memetic approach for three degree-dependent spanning tree problems
cites work: Bounded-degree spanning tree problems: models and new algorithms
cites work: Integer Programming
cites work: Solution of a Large-Scale Traveling-Salesman Problem
cites work: Q4947393
cites work: Q4737170
cites work: Reformulations and solution algorithms for the maximum leaf spanning tree problem
cites work: Q4845371
cites work: Exact and heuristic solutions for the minimum number of branch vertices spanning tree problem
cites work: An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices
cites work: Integer Programming Formulation of Traveling Salesman Problems
cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
cites work: Trees and Cuts
cites work: A simple test on 2-vertex- and 2-edge-connectivity
cites work: An edge-swap heuristic for generating spanning trees with minimum number of branch vertices
DBLP publication ID: journals/cor/SilvestriLC17
DOI: 10.1016/J.COR.2016.11.010
Recommended article: A branch and cut method for the degree-constrained minimum spanning tree problem
Recommended article: A generalization of the minimum branch vertices spanning tree problem
Recommended article: A branch and cut algorithm for minimum spanning trees under conflict constraints
Recommended article: A branch and bound algorithm for the capacitated minimum spanning tree problem
Recommended article: A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem
Recommended article: Exact and heuristic solutions for the minimum number of branch vertices spanning tree problem
Recommended article: Q4813065
Recommended article: A branch-and-bound algorithm for the mini-max spanning forest problem
Recommended article: Finding min-degree constrained spanning trees faster with a branch-and-cut algorithm
Recommended article: The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm
description: scientific article; zbMATH DE number 6901393