| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652689 | Electronic Notes in Discrete Mathematics | 2008 | 6 Pages |
Abstract
In this paper, we present two Integer Programming formulations for the k-Cardinality Tree Problem. The first is a multiflow formulation while the second uses a lifting of the Miller-Tucker-Zemlin constraints. Based on our computational experience, we suggest a two-phase exact solution approach that combines two different solution techniques, each one exploring one of the proposed formulations.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
