Method of attack by using a set covering algorithm repeatedly on much smaller matrices extracted from the overall problem is outlined. Approach has been used on an airline crew-scheduling problem, with good practical success on test cases involving close to 1000 rows.