Title of article
Integer Programming Formulations for the k-Cardinality Tree Problem
Author/Authors
Quintمo، نويسنده , , Frederico P. and da Cunha، نويسنده , , Alexandre Salles and Mateus، نويسنده , , Geraldo R.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
6
From page
225
To page
230
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.
Keywords
integer programming , k-Cardinality Tree Problem
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2008
Journal title
Electronic Notes in Discrete Mathematics
Record number
1454860
Link To Document