Name
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. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1016/j.endm.2008.01.039 | Electronic Notes in Discrete Mathematics |
Keywords | Field | DocType |
k-Cardinality Tree Problem,Integer Programming | Exact solutions in general relativity,Discrete mathematics,Combinatorics,Nearest integer function,Branch and price,Cardinality,Integer programming,Mathematics | Journal |
Volume | ISSN | Citations |
30 | 1571-0653 | 3 |
PageRank | References | Authors |
0.48 | 5 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Frederico P. Quintão | 1 | 8 | 0.97 |
| Alexandre Salles da Cunha | 2 | 242 | 22.32 |
| Geraldo R. Mateus | 3 | 134 | 13.00 |