S. Esmeir and S. Markovitch, Anytime learning of decision trees, Journal of Machine Learning Research, vol.8, pp.891-933, 2007.

L. Hyafil and R. L. Rivest, Constructing optimal binary decision trees is NPcomplete, Inf. Process. Lett, vol.5, issue.1, pp.15-17, 1976.

G. Katsirelos and T. Walsh, A compression algorithm for large arity extensional constraints, Lecture Notes in Computer Science, vol.4741, pp.379-393, 2007.

P. Prosser and C. Unsworth, Rooted tree and spanning tree constraints, Workshop on Modelling and Solving Problems with Constraints, held at ECAI 06, 2006.

J. R. Quinlan, Induction of decision trees, Machine Learning, vol.1, pp.81-106, 1986.

R. J. Quinlan, C4.5: programs for machine learning, 1993.

P. E. Utgoff, N. C. Berkman, and J. A. Clouse, Decision tree induction based on efficient tree restructuring, Machine Learning, vol.29, pp.5-44, 1997.

H. Ian, E. Witten, and . Frank, Data Mining: Practical machine learning tools and techniques, 2005.

F. Yüksektepe and M. Türkay, A mixed-integer programming approach to multi-class data classification problem, European Journal of OR, vol.173, issue.3, pp.910-920, 2006.