This chapter explains a group of asset allocation algorithms that takes advantage of the hierarchical relationships that can be identified using a special graph called dendrogram. These types of algorithms have become popular since the development of the hierarchical risk parity algorithm, because they combine hierarchical clustering algorithms and asset allocation techniques. The main advantage of these algorithms is that they can incorporate nonconvex risk measures easily. The main disadvantage of these algorithms is that they cannot incorporate real features like linear constraints or short because they are not proper optimization models.