Weil, Roman L.; Kettler, Paul C. - In: Management Science 18 (1971) 1, pp. 98-108
The rows and columns of an arbitrary coefficient matrix of large numerical problems can often be permuted so that substantial time can be saved in computations. For example, if a large linear programming problem has a suitable block-angular structure, one of the time-saving decomposition...
