Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints
type: Item
instance of: scholarly article
title: Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints
zbMATH Open document ID: 1171.90532
author: İbrahim Akgün
author: B. Tansel
published in: Computers \& Operations Research
publication date: 2009-10-16T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 05C80
zbMATH DE Number: 5616462
zbMATH Keywords: mixed integer programming
zbMATH Keywords: degree-enforcing constraints
zbMATH Keywords: Miller-Tucker-Zemlin constraints
zbMATH Keywords: minimum spanning tree
zbMATH Keywords: flow formulation
zbMATH Keywords: rooted arborescence
MaRDI profile type: Publication
full work available at URL: j.cor.2009.03.006
OpenAlex ID: W2044793578
cites work: Q3056948
cites work: On the shortest spanning subtree of a graph and the traveling salesman problem
cites work: Integer Programming Formulation of Traveling Salesman Problems
cites work: Q4198056
cites work: Edge exchanges in the degree-constrained minimum spanning tree problem
cites work: A branch and cut method for the degree-constrained minimum spanning tree problem
cites work: Variable neighborhood search for the degree-constrained minimum spanning tree problem
cites work: Using Lagrangian dual information to generate degree constrained spanning trees
cites work: Comparison of algorithms for the degree constrained minimum spanning tree
cites work: Q4845371
cites work: An analytical comparison of different formulations of the travelling salesman problem
cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
cites work: Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
cites work: Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
cites work: The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints
cites work: On Tightening the Relaxations of Miller-Tucker-Zemlin Formulations for Asymmetric Traveling Salesman Problems
cites work: A Lagrangean approach to the degree-constrained minimum spanning tree problem
DOI: 10.1016/J.COR.2009.03.006
description: scientific article; zbMATH DE number 5616462