par Figueiredo, Rosa;Labbé, Martine ;De Souza, Cid Carvalho
Référence Computers & operations research, 38, 11, page (1483-1492)
Publication Publié, 2011-11
Article révisé par les pairs
Résumé : 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 01 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. © 2011 Elsevier Ltd.