Polyhedral results for a class of cardinality constrained submodular minimization problems
نویسندگان
چکیده
منابع مشابه
Polyhedral results for a class of cardinality constrained submodular minimization problems
Motivated by concave cost combinatorial optimization problems, we study the following mixed integer nonlinear set: P = {(w, x) ∈ R× {0, 1}n : w ≥ f (a′x), e′x ≤ k} where f : R 7→ R is a concave function, n and k are positive integers, a ∈ Rn is a nonnegative vector, e ∈ Rn is a vector of ones, and x′y denotes the scalar product of vectors x and y of same dimension. A standard linearization appr...
متن کاملExact LASSO Solutions for a Class of Constrained Cardinality Minimization Problems
This paper shows that the least absolute shrinkage and selection operator (LASSO) can provide an exact optimal solution to a special type of constrained cardinality minimization problem, which is motivated from a sensor network measurement robustness analysis problem. The constraint matrix of the considered problem is totally unimodular. This is shown to imply that LASSO leads to a tight linear...
متن کاملPolyhedral results for the Cardinality Constrained Multi-cycle Problem (CCMcP) and the Cardinality Constrained Cycles and Chains Problem (CCCCP)
In recent years, there has been studies on the cardinality constrained multi-cycle problems on directed graphs, some of which considered chains co-existing on the same digraph whilst others did not. These studies were inspired by the optimal matching of kidneys known as the Kidney Exchange Problem (KEP). In a KEP, a vertex on the digraph represents a donor-patient pair who are related, though t...
متن کاملA Polyhedral Study of the Cardinality Constrained Knapsack Problem
A cardinality constrained knapsack problem is a continuous knapsack problem in which no more than a specified number of nonnegative variables are allowed to be positive. This structure occurs, for example, in areas as finance, location, and scheduling. Traditionally, cardinality constraints are modeled by introducing auxiliary 0-1 variables and additional constraints that relate the continuous ...
متن کاملActive-set Methods for Submodular Minimization Problems
We consider the submodular function minimization (SFM) and the quadratic minimization problems regularized by the Lovász extension of the submodular function. These optimization problems are intimately related; for example, min-cut problems and total variation denoising problems, where the cut function is submodular and its Lovász extension is given by the associated total variation. When a qua...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2017
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2015.07.005