A multiperiod degree constrained minimal spanning tree problem
type: Item
instance of: scholarly article
title: A multiperiod degree constrained minimal spanning tree problem
zbMATH Open document ID: 1073.90530
DOI: 10.1016/S0377-2217(01)00321-6
author: Rakesh Kawatra
published in: European Journal of Operational Research
publication date: 2002-11-13T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90B18
zbMATH DE Number: 1827413
zbMATH Keywords: Integer programming
zbMATH Keywords: Communication networks
zbMATH Keywords: Heuristics
MaRDI profile type: Publication
cites work: Minimum-weight degree-constrained spanning tree problem: Heuristics and implementation on an SIMD parallel machine
cites work: Q4350039
cites work: An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs
cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems
cites work: A good algorithm for smallest spanning trees with a degree constraint
cites work: Q4198056
cites work: Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
cites work: Topological design of centralized computer networks—formulations and algorithms
cites work: Validation of subgradient optimization
cites work: Edge exchanges in the degree-constrained minimum spanning tree problem
cites work: A Lagrangean approach to the degree-constrained minimum spanning tree problem
cites work: The Held—Karp algorithm and degree-constrained minimum 1-trees
description: scientific article; zbMATH DE number 1827413