Advanced search
Start date
Betweenand

GRASP heuristics for identifying network matrices in linear systems

Grant number: 06/00952-8
Support type:Scholarships in Brazil - Scientific Initiation
Effective date (Start): September 01, 2006
Effective date (End): August 31, 2007
Field of knowledge:Physical Sciences and Mathematics - Computer Science - Theory of Computation
Principal researcher:Cid Carvalho de Souza
Grantee:João Marcos da Cunha Silva
Home 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)

News published in Agência FAPESP Newsletter about the scholarship:
Articles published in other media outlets (0 total):
More itemsLess items
VEICULO: TITULO (DATA)
VEICULO: TITULO (DATA)

Please report errors in scientific publications list by writing to: cdi@fapesp.br.