Minimum ratio cover of matrix columns by extreme rays of its induced cone - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

Minimum ratio cover of matrix columns by extreme rays of its induced cone

Abstract

Given a matrix S∈ℝm ×n and a subset of columns R, we study the problem of finding a cover of R with extreme rays of the cone $\mathcal{F}=\{v \in \mathbb{R}^n \mid Sv=\mathbf{0}, v\geq \mathbf{0}\}$, where an extreme ray v covers a column k if vk>0. In order to measure how proportional a cover is, we introduce two different minimization problems, namely the minimum global ratio cover (MGRC) and the minimum local ratio cover (MLRC) problems. In both cases, we apply the notion of the ratio of a vector v, which is given by $\frac{\max_i v_i}{\min_{j\mid v_j > 0} v_j}$. We show that these two problems are NP-hard, even in the case in which |R|=1. We introduce a mixed integer programming formulation for the MGRC problem, which is solvable in polynomial time if all columns should be covered, and introduce a branch-and-cut algorithm for the MLRC problem. Finally, we present computational experiments on data obtained from real metabolic networks.
Fichier principal
Vignette du fichier
Minimum_ratio_cover_of_matrix_columns_by_extreme_rays_of_its_induced_cone_Freire_et_al.pdf (217.79 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00763453 , version 1 (10-12-2012)

Identifiers

Cite

Alexandre da Silva Freire, Vicente Acuña, Pierluigi Crescenzi, Carlos Eduardo Ferreira, Vincent Lacroix, et al.. Minimum ratio cover of matrix columns by extreme rays of its induced cone. Proceedings of the Second international Symposium on Combinatorial Optimization (ISCO), Apr 2012, Athens, Greece. pp.165--177, ⟨10.1007/978-3-642-32147-4_16⟩. ⟨hal-00763453⟩
439 View
271 Download

Altmetric

Share

Gmail Facebook X LinkedIn More