Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem
type: Item
instance of: scholarly article
title: Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem
zbMATH Open document ID: 1343.90101
author: Luis Henrique Bicalho
author: Alexandre Salles da Cunha
author: Abilio Lucena
published in: Computational Optimization and Applications
publication date: 2016-04-04T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6562677
zbMATH Keywords: degree constrained spanning tree
zbMATH Keywords: branch-and-cut
zbMATH Keywords: branch-and-cut-and-price
describes a project that uses: SteinLib
MaRDI profile type: MaRDI publication profile
full work available at URL: s10589-015-9788-7
OpenAlex ID: W1747465883
cites work: Branching rules revisited
cites work: Using Lagrangian dual information to generate degree constrained spanning trees
cites work: A branch and cut method for the degree-constrained minimum spanning tree problem
cites work: Q4350039
cites work: Lower and upper bounds for the degree-constrained minimum spanning tree problem
cites work: Solution of a Large-Scale Traveling-Salesman Problem
cites work: Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem
cites work: Benchmarking optimization software with performance profiles.
cites work: Trees and Cuts
cites work: Local branching
cites work: Q4198056
cites work: Topological design of centralized computer networks—formulations and algorithms
cites work: Q4178782
cites work: Solving Steiner tree problems in graphs to optimality
cites work: On the shortest spanning subtree of a graph and the traveling salesman problem
cites work: Integer Programming and Combinatorial Optimization
cites work: Strong lower bounds for the prize collecting Steiner problem in graphs
cites work: Q3109938
cites work: Spanning tree manipulation and the travelling salesman problem
cites work: Variable neighborhood search for the degree-constrained minimum spanning tree problem
cites work: A Lagrangean approach to the degree-constrained minimum spanning tree problem
cites work: A note on genetic algorithms for degree-constrained spanning tree problems
DOI: 10.1007/S10589-015-9788-7
description: scientific article; zbMATH DE number 6562677