Algorithm of k-L Squared Cover on a Defective PlaneLUO Yu,ZHONG Luo (School of Computer Science & Technology,Wuhan University of Technology,Wuhan 430070,China)This paper proposed a branching-cutting search algorithm for solving the defective plane covered by k-L squared covers problem.The main idea was to divide k-L squared cover into two pieces of rectangles to consist a set of selection of the plane,then searched matching rectangles and gradually gave the approximate optimized solution by branching-cutting search algorithm.Experimental results demonstrated that the algorithm was effective in solving less large scaled defective plane covering problem.defective plane;k-L squared cover;method of branching-cutting;search algorithm