Given a connected digraph, a vertex designated as the root, and an integer
, the
‐arborescence star problem is to choose
vertices besides the root and define a reverse arborescence spanning them. Each vertex outside the arborescence must be assigned to one vertex inside it. The objective of the problem is to minimize arborescence and assignment costs. We propose two formulations for the...