The concept of this project is to solve family tree-based problems with an acyclic structure of nodes. Given a set of rules and facts, the objective is to create a knowledge base for the following ...

Dynamic programming is a powerful tool for most complex optimization problems that can be used in computer science and math sciences to efficiently deal with a wide range of difficult computation ...

Tree-like structures are common, naturally occurring objects that are of interest to many fields of study, such as plant science and biomedicine. Analysis of these structures is typically based on ...

The present work provides a general framework for tree partitioning problems based on mixed-integer linear programming (MILP). In particular, we present a novel MILP formulation to optimally solve ...