Experience with solving a 12,753,313 variable linear program is described. This problem is the linear programming relaxation of a set partitioning problem arising from an airline crew scheduling ...

The de facto standard approach of promoting sparsity by means of ℓ1-regularization becomes ineffective in the presence of simplex constraints, that is, when the target is known to have non-negative ...