Minimal spanning trees with a constraint on the number of leaves
Authors:
- Lucinda Matos FernandesLFLucinda Matos Fernandes
- Luis GouveiaLGLuis Gouveia
- 1 January 1998
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 104 (1) , 250-261
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Multicommodity flow models for spanning trees with hop constraintsEuropean Journal of Operational Research, 1996
- A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree ProblemOperations Research, 1995
- A short note on the approximability of the maximum leaves spanning tree problemInformation Processing Letters, 1994
- An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete DigraphsINFORMS Journal on Computing, 1993
- A Lagrangean approach to the degree-constrained minimum spanning tree problemEuropean Journal of Operational Research, 1989
- Augmented Lagrangean Based Algorithms for Centralized Network DesignIEEE Transactions on Communications, 1985
- Topological design of centralized computer networks—formulations and algorithmsNetworks, 1982
- Validation of subgradient optimizationMathematical Programming, 1974
- Lagrangean relaxation for integer programming1974
- Shortest Connection Networks And Some GeneralizationsBell System Technical Journal, 1957