cff-version: 1.2.0
abstract: "<p>STreeD is a framework for optimal binary decision trees with separable optimization tasks. A separable optimization task is a task that can be optimized separately for the left and right subtree. The current STreeD Framework implements a broad set of such optimization tasks, from group fairness constraints to prescriptive policy generation. For an explanation of each application, see below. For details on what tasks are separable and how the algorithm works, see our paper.</p>"
authors:
  - family-names: van der Linden
    given-names: Jacobus G. M.
    orcid: "https://orcid.org/0009-0001-4015-0594"
  - family-names: de Weerdt
    given-names: M.M. (Mathijs)
    orcid: "https://orcid.org/0000-0002-0470-6241"
  - family-names: Demirovic
    given-names: Emir
title: "Source code and data for the paper &#34;Necessary and Sufficient Conditions for Optimal Decision Trees using Dynamic Programming&#34;"
keywords:
version: 1
identifiers:
  - type: doi
    value: 10.4121/cb4f4468-05d1-4309-bc4b-d74748e3cfba.v1
license: MIT
date-released: 2023-11-01