We formulated and solved the fleet assignment problem as an integer linear programming model, permitting assignment of two or more fleets to a flight schedule simultaneously. The objective function ...

This interval is determined using linear programming techniques. Finally, bounding convex envelope approximating problems are constructed and solved globally over any remaining intervals. Intervals ...