37 citations · 126 across the 25 of their papers we have counts for
1 paper · 2 filters
Niko Beerenwinkel, Stefano Beretta, Paola Bonizzoni +2
The Minimum Path Cover problem on directed acyclic graphs (DAGs) is a classical problem that provides a clear and simple mathematical formulation for several applications in differ…