This paper describes an approach for optimizing a key element of air base recovery after attack—the repair of craters on linear taxiway segments. Drawing upon the concept of a minimal cut set, familiar in reliability engineering, an algebraic representation of the problem is developed in the form of a weighted set covering problem. This supplants the use of complex logical algorithms for checking the feasibility of solutions postulated during enumerative solution of the repair minimization problem. It is demonstrated that the algebraic representation leads to enhanced computational efficiency. Also, a potential advantage is suggested for the algebraic approach in facilitating extensions of repair minimization to nonlinear taxiway segments, including intersections.