Abstract
In this project we are interested in the obtention of large network matrices that occur as submatrices of the constraint matrix of theInteger Programming models of Combinatorial Optimization problems such as Partition, Covering and Packing of subsets. The goal is to find thelargest network submatrix and to this end we will use metaheuristics based on the GRASP technique. The quality of th…