Optimization Online


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

R. M. V. Figueiredo(rosa***at***ime.uerj.br)
M. Labbé(mlabbe***at***ulb.ac.be)
C. C. de Souza(cid***at***ic.unicamp.br)

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 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.

Keywords: Network matrix, signed graph, facets of polyhedra, branch-and-cut.

Category 1: Combinatorial Optimization (Branch and Cut Algorithms )

Category 2: Combinatorial Optimization (Polyhedra )

Category 3: Network Optimization


Download: [PDF]

Entry Submitted: 01/29/2010
Entry Accepted: 01/29/2010
Entry Last Modified: 01/29/2010

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society