2026-10-14T05:26:37Z https://data.mendeley.com/oai

oai:data.mendeley.com/9zf29kwjyb.2 2025-12-04T23:55:19Z

Aydoğan, Çiya Branch and Price Algorithm for Tail Assignment Problem with Hour-to-Cycle Ratio Constraints Mendeley Data 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. Mathematical Optimization Airline Gürel, Sinan Dataset doi:10.17632/9zf29kwjyb.2 oai:data.mendeley.com/9zf29kwjyb.2 Creative Commons Attribution 4.0 International http://creativecommons.org/licenses/by/4.0 https://data.mendeley.com/datasets/9zf29kwjyb 2025-12-04T23:55:19Z