An LP-based heuristic algorithm for the node capacitated in-tree packing problem

► Introducing node capacities to a spanning arborescence packing problem on digraphs. ► Generating in-trees by the column generation method. ► Solving the minimum weight rooted arborescence problem as the pricing problem. ► Packing in-trees by a greedy algorithm with efficient data structures. ► The approximation guarantee of LP-based algorithms.