论文信息 - Integer Programming Formulations for the k-Cardinality Tree Problem

Integer Programming Formulations for the k-Cardinality Tree Problem

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.

Alexandre Salles da Cunha | Geraldo Robson Mateus | Frederico Paiva Quintão

[1] R. A. Zemlin,et al. Integer Programming Formulation of Traveling Salesman Problems , 1960, JACM.

[2] Takeo Yamada,et al. Upper and lower bounding procedures for minimum rooted k-subtree problem , 2000, Eur. J. Oper. Res..

[3] Matteo Fischetti,et al. Weighted k-cardinality trees: Complexity and polyhedral structure , 1994, Networks.

[4] Nenad Mladenović,et al. Variable Neighborhood Search for the Vertex Weighted k -Cardinality Tree , 2004 .

[5] Gilbert Laporte,et al. Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints , 1991, Oper. Res. Lett..

[6] M. Ehrgott,et al. Heuristics for the K-Cardinality Tree and Subgraph Problems , 1996 .

[7] Christian Blum,et al. Local Search Algorithms for the k-cardinality Tree Problem , 2003, Discret. Appl. Math..

[8] Matteo Fischetti,et al. Local branching , 2003, Math. Program..