@article{oai:oacis.repo.nii.ac.jp:00001749,
 author = {Wu, Wei and Hu, Yannan and Hashimoto, Hideki and Ando, Tomohito and Shiraki, Takashi and Yagiura, Mutsunori},
 issue = {3},
 journal = {Journal of Advanced Mechanical Design, Systems, and Manufacturing},
 month = {},
 note = {In this paper, we consider the crew pairing problem in airline scheduling that calls for assigning crew members in order to cover all flights with the minimum total person-days under the constraints that the schedule of each crew member does not violate given constraints on the total working time, flying time, and the number of landings. In practical applications, it is difficult to create an efficient schedule satisfying all the constraints. We formulate the problem as a set covering problem and apply an LP-based column generation approach to generate a candidate set of schedules. We propose a branch-and-bound method based upon a resource constrained dynamic programming for the column generation procedure. Computational results are given for a number of large-scale instances with up to 10,000 flights., 15K16293},
 title = {A column generation approach to the airline crew pairing problem to minimize the total person-days},
 volume = {10},
 year = {2016}
}