This paper presents a successful application of integer programming to the scheduling of flight crews for a cargo airline. The crew planning process is discussed, the role of the set partitioning model is explained, and representative computational experience is reported. The success of this...

The two duty period scheduling problem is an integer programming problem with 0-1 constraint coefficients. It is recognized that the problem can be reformulated as a one duty period problem with side constraints. Since the one duty period problem can be solved as a minimal cost network flow...

No abstract available.

An algorithm is presented for the special integer linear program known as the set partitioning problem. This problem has a binary coefficient matrix, binary variables, and unit resources. Furthermore, all of its constraints are equations. In spite of its very special form, the set partitioning...

An algorithm which recursively generates the complete family of undominated feasible solutions to separable nonlinear multidimensional knapsack problems is developed by exploiting discontinuity preserving properties of the maximal convolution. The "curse of dimensionality," which is usually...