The capacitated minimum spanning tree problem: On improved multistar constraints
type: Item
instance of: scholarly article
title: The capacitated minimum spanning tree problem: On improved multistar constraints
zbMATH Open document ID: 1067.90141
author: Maria João Lopes
author: Luis Gouveia
published in: European Journal of Operational Research
publication date: 2004-11-22T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 2117489
zbMATH Keywords: Capacitated trees
zbMATH Keywords: Multistar constraints
zbMATH Keywords: Subset sum problems
zbMATH Keywords: Valid inequalities
zbMATH Keywords: Lagrangean relaxation
MaRDI profile type: Publication
full work available at URL: j.ejor.2003.10.021
OpenAlex ID: W2031476167
cites work: Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem
cites work: An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs
cites work: Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
cites work: Q4178782
cites work: Valid inequalities for non-unit demand capacitated spanning tree problems with flow costs
cites work: Q4944737
cites work: Dynamic programming based heuristics for the topological design of local access networks
cites work: Experience with a Cutting Plane Algorithm for the Capacitated Spanning Tree Problem
cites work: Validation of subgradient optimization
cites work: Q4845371
cites work: Q3993418
cites work: The complexity of the capacitated tree problem
DOI: 10.1016/J.EJOR.2003.10.021
description: scientific article; zbMATH DE number 2117489