Abstract
We discuss the airline crew pairing optimization problem and present a solution method based on a combination of column and cut generation. The generated cuts are a subclass of subset-row inequalities. The pricing subproblem is solved by a label-setting algorithm with a new backtracking scheme and consideration of the generated cuts. The solution method for the linear relaxation is embedded in a branch-and-bound procedure with a constraint branching strategy and a new search strategy. We test our method on instances from domestic flight schedules of a European Airline.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
