We have a network and a set of critical vertices. Each critical vertex
is associated with a deadline. The goal is to route a package on a
Hamiltonian cycle in the network while guaranteeing the package to
reach each critical vertex no later than its deadline.

In the optimization version, the objective is to minimize the time of
reaching the critical node 1. The instances for the optimization
version are instances-asp-int-500 and instances-mip-int-500 for mingoR
and cplex, respectively.
