An exact approach to the problem of extracting an embedded network matrix

dc.creatorFigueiredo, RMV
dc.creatorLabbe, M
dc.creatorde Souza, CC
dc.date2011
dc.dateNOV
dc.date2014-07-30T13:48:39Z
dc.date2015-11-26T16:34:09Z
dc.date2014-07-30T13:48:39Z
dc.date2015-11-26T16:34:09Z
dc.date.accessioned2018-03-28T23:16:20Z
dc.date.available2018-03-28T23:16:20Z
dc.identifierComputers & Operations Research. Pergamon-elsevier Science Ltd, v. 38, n. 11, n. 1483, n. 1492, 2011.
dc.identifier0305-0548
dc.identifierWOS:000289604700003
dc.identifier10.1016/j.cor.2011.01.003
dc.identifierhttp://www.repositorio.unicamp.br/jspui/handle/REPOSIP/54398
dc.identifierhttp://repositorio.unicamp.br/jspui/handle/REPOSIP/54398
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1271113
dc.descriptionCoordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
dc.descriptionConselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
dc.descriptionWe 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.
dc.description38
dc.description11
dc.description1483
dc.description1492
dc.descriptionCoordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
dc.descriptionConselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
dc.descriptionCoordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
dc.descriptionConselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
dc.descriptionCNPq [301732/2007-8, 473867/2010-9]
dc.languageen
dc.publisherPergamon-elsevier Science Ltd
dc.publisherOxford
dc.publisherInglaterra
dc.relationComputers & Operations Research
dc.relationComput. Oper. Res.
dc.rightsfechado
dc.rightshttp://www.elsevier.com/about/open-access/open-access-policies/article-posting-policy
dc.sourceWeb of Science
dc.subjectNetwork matrix
dc.subjectSigned graph
dc.subjectFacets of polyhedra
dc.subjectBranch-and-cut
dc.subjectLinear-programs
dc.subjectSigned Graphs
dc.subjectAlgorithm
dc.subjectPolytope
dc.subjectPacking
dc.subjectRows
dc.titleAn exact approach to the problem of extracting an embedded network matrix
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución