×
  • A Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints

    Ascheuer N. Junger M. Reinelt G.

Click on cover to enlarge.
Buy This Book
From Amazon.
0 - 1Hours to read