Branch and Price Algorithm for Tail Assignment Problem with Hour-to-Cycle Ratio Constraints

There are 90 instances. Each file contains data for an instance.
The name of the files represents the parameter setting used.
N(x) indicates there are x aircraft in the instance.
horizon(x) indicates that the horizon day is x for the instance.
We have 3 replications for each parameter setting. rep(1), rep(2), rep(3) indicates the replication number.