Weightedk-cardinality trees: Complexity and polyhedral structure
- 1 January 1994
- Vol. 24 (1) , 11-21
- https://doi.org/10.1002/net.3230240103
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- A lifting procedure for the asymmetric traveling salesman polytope and a large new class of facetsMathematical Programming, 1993
- The Fixed-Outdegree 1-Arborescence PolytopeMathematics of Operations Research, 1992
- Facets of two Steiner arborescence polyhedraMathematical Programming, 1991
- Recursive analysis of network reliabilityNetworks, 1973
- Shortest Connection Networks And Some GeneralizationsBell System Technical Journal, 1957