Abstract:
Yen and Birge (2006) formulate the airline crew scheduling problem as a two-stage
stochastic integer programme with recourse. They develop an algorithm, the flight-pair
branching algorithm, to solve the problem. In this note we show, by means of an example,
that the algorithm does not necessarily terminate with an optimal solution.