Please use this identifier to cite or link to this item:
Type: Artigo de periódico
Title: An exact approach to the problem of extracting an embedded network matrix
Author: Figueiredo, RMV
Labbe, M
de Souza, CC
Abstract: We study the problem of detecting a maximum embedded network submatrix in a (-1,0,+1)-matrix. Our aim is to solve the problem to optimality. We introduce a 0-1 integer linear programming formulation for this problem based on its representation over a signed graph. A polyhedral study is presented and a branch-and-cut algorithm is described for finding an optimal solution to the problem. Some computational experiments are carried out over a set of instances available in the literature as well as over a set of random instances. (C) 2011 Elsevier Ltd. All rights reserved.
Subject: Network matrix
Signed graph
Facets of polyhedra
Country: Inglaterra
Editor: Pergamon-elsevier Science Ltd
Rights: fechado
Identifier DOI: 10.1016/j.cor.2011.01.003
Date Issue: 2011
Appears in Collections:Artigos e Materiais de Revistas Científicas - Unicamp

Files in This Item:
File Description SizeFormat 
WOS000289604700003.pdf403.24 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.