Weightedk-cardinality trees: Complexity and polyhedral structure
- 1 January 1994
- Vol. 24 (1), 11-21
- https://doi.org/10.1002/net.3230240103
Abstract
We consider the k-CARD TREE problem, i.e., the problem of finding in a given undirected graph G a subtree with k edges, having minimum weight. Applications of this problem arise in oil-field leasing and facility layout. Although the general problem is shown to be strongly NP hard, it can be solved in polynomial time if G is itself a tree. We give an integer programming formulation of k-CARD TREE and an efficient exact separation routine for a set of generalized subtour elimination constraints. The polyhedral structure of the convex hull of the integer solutions is studied. © 1994 by John Wiley & Sons, Inc.Keywords
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