Abstract
In this project we are interested in the obtention of large network matrices that occur as submatrices of the constraint matrix of the Integer Programming models of Combinatorial Optimization problems such as Partition, Covering and Packing of subsets. The goal is to find the largest network submatrix and to this end we will use models and tools from Integer Programming, including enumera…