An airline has p flight legs that it wishes to service by the fewest possible planes . To do so , it must determine the most efficient way to...

1 . An airline has p flight legs that it wishes to service by the fewest possible planes . To do so , itmust determine the most efficient way to combine these legs into flight schedules . The startingtime for flight i is a; and the finishing time is bi . The plane requires rij hours to return from*the point of destination of flight ; to the point of origin of flight j . Formulate this problem as aminimum flow problem .