Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: complexity, properties and formulations
type: Item
instance of: scholarly article
title: Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: complexity, properties and formulations
zbMATH Open document ID: 1391.90602
author: Fabio C. S. Dias
author: Críston Souza
author: Rafael Andrade
author: Manoel Campêlo
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 6901429
zbMATH Keywords: min-degree constrained minimum spanning tree problem
zbMATH Keywords: integer programming
zbMATH Keywords: Lagrangian heuristic
MaRDI profile type: Publication
full work available at URL: j.cor.2017.03.001
OpenAlex ID: W2592716126
cites work: Q4325280
cites work: Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints
cites work: Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations
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: Q4133397
cites work: Lower and upper bounds for the degree-constrained minimum spanning tree problem
cites work: Convergence Analysis of Deflected Conditional Approximate Subgradient Methods
cites work: Solution of a Large-Scale Traveling-Salesman Problem
cites work: Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
cites work: Approximating the Minimum-Degree Steiner Tree to within One of Optimal
cites work: Q4198056
cites work: Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
cites work: Reformulation by Intersection Method on the MST Problem with Lower Bound on the Number of Leaves
cites work: Q4845371
cites work: Using separation algorithms to generate mixed integer model reformulations
cites work: A Parallel Lagrangian Relaxation Algorithm for the Min-Degree Constrained Minimum Spanning Tree Problem
cites work: The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm
cites work: VNS and second order heuristics for the min-degree constrained minimum spanning tree problem
cites work: Integer Programming Formulation of Traveling Salesman Problems
cites work: On a graph theorem by dirac
cites work: Trees and Cuts
cites work: Variable neighborhood search for the degree-constrained minimum spanning tree problem
cites work: Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem
cites work: Q4254875
DOI: 10.1016/J.COR.2017.03.001
description: scientific article; zbMATH DE number 6901429