A branch-and-cut algorithm for the target visitation problem

Achim Hildenbrandt. A branch-and-cut algorithm for the target visitation problem. EURO J. Computational Optimization, 7(3):209-242, 2019. [doi]

Possibly Related Publications

The following publications are possibly variants of this publication: