GRASP heuristics for identifying network matrices in linear systems

• Grant number: 06/00952-8
• Support Opportunities: Scholarships in Brazil - Scientific Initiation
• Start date: September 01, 2006
• End date: August 31, 2007
• Field of knowledge: Physical Sciences and Mathematics - Computer Science - Theory of Computation
• Principal Investigator: Cid Carvalho de Souza
• Grantee: João Marcos da Cunha Silva
• Host Institution: Instituto de Computação (IC). Universidade Estadual de Campinas (UNICAMP). Campinas , SP, Brazil

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 the solutions generatedby the heuristics will be assessed through comparisons with another heuristic proposed in the literature and with dual bounds and optimalsolutions produced by algorithms to be developed in another research project that is being submitted simultaneously. (AU)