Embedding Decision Trees and Random Forests in Constraint Programming

DOI10.1007/978-3-319-18008-3_6zbMath1459.68189OpenAlexW829296453MaRDI QIDQ5741458

Michele Lombardi, Michela Milano, Alessio Bonfietti

Publication date: 25 July 2016

Published in: Integration of AI and OR Techniques in Constraint Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-18008-3_6

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (7)

Learning optimal decision trees using constraint programming ⋮ A Lagrangian propagator for artificial neural networks in constraint programming ⋮ Mixed-Integer Convex Nonlinear Optimization with Gradient-Boosted Trees Embedded ⋮ Optimization over decision trees: a case study for the design of stable direct-current electricity networks ⋮ Empirical decision model learning ⋮ Classifier-based constraint acquisition ⋮ Deep learning assisted heuristic tree search for the container pre-marshalling problem

This page was built for publication: Embedding Decision Trees and Random Forests in Constraint Programming