|   | 
Author Acuna, V.; Ferreira, C.E.; Freire, A.S.; Moreno, E.
Title Solving the maximum edge biclique packing problem on unbalanced bipartite graphs Type
Year 2014 Publication Discrete Applied Mathematics Abbreviated Journal Discret Appl. Math.
Volume 164 Issue Pages 2-12
Keywords Maximum edge biclique packing; Branch-and-price; Metabolic networks; Product bundling
Abstract A biclique is a complete bipartite graph. Given an (L, R)-bipartite graph G = (V, E) and a positive integer k, the maximum edge biclique packing (num') problem consists in finding a set of at most k bicliques, subgraphs of G, such that the bicliques are vertex disjoint with respect to a subset of vertices S, where S E {V, L, R}, and the number of edges inside the bicliques is maximized. The maximum edge biclique (mEs) problem is a special case of the MEBP problem in which k = 1. Several applications of the MEB problem have been studied and, in this paper, we describe applications of the MEBP problem in metabolic networks and product bundling. In these applications the input graphs are very unbalanced (i.e., IRI is considerably greater than ILI), thus we consider carefully this property in our models. We introduce a new formulation for the MEB problem and a branch-and-price scheme, using the classical branch rule by Ryan and Foster, for the MEBP problem. Finally, we present computational experiments with instances that come from the described applications and also with randomly generated instances. (C) 2011 Elsevier B.V. All rights reserved.
Address [Acuna, V.] Univ Lyon 1, F-69622 Villeurbanne, France, Email: afreire@ime.usp.br
Corporate Author Thesis
Publisher Elsevier Science Bv Place of Publication Editor
Language English Summary Language Original Title
Series Editor Series Title Abbreviated Series Title (up)
Series Volume Series Issue Edition
ISSN 0166-218x ISBN Medium
Area Expedition Conference
Notes WOS:000332427400002 Approved
Call Number UAI @ eduardo.moreno @ Serial 361
Permanent link to this record