On a Variant of the Minimum Path Cover Problem in Acyclic Digraphs: Computational Complexity Results and Exact Method

Nour El Houda Tellache, Roberto Baldacci. On a Variant of the Minimum Path Cover Problem in Acyclic Digraphs: Computational Complexity Results and Exact Method. Networks, 86(3):325-357, 2025. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.