We provide a general method to generate randomized roundings that satisfy cardinality constraints. Our approach is different from the one taken by Srinivasan (FOCS 2001) and Gandhi et al. (FOCS 2002) for one global constraint and the bipartite edge weight rounding problem. Also for these special cases, our approach is the first that can be derandomized. For the bipartite edge weight rounding pr...

A portfolio optimal model with cardinality constraints is researched, in which the minimum of Value-at-Risk is taken as the objective function. We give a hybrid differential evolution algorithm to solve the model and make the case study with sixteen alternative stocks from Shanghai and Shenzhen stock market. The numerical results show that the given model is reasonable and the given algorithm i...

We study the polyhedral convex hull structure of a mixed-integer set which arises in class cardinality-constrained concave submodular minimization problems. This problems has an objective function form $$f(a^\top x)$$ , where f is univariate function, non-negative vector, and x binary vector appropriate dimension. Such frequently appear applications that involve risk-aversion or economies scale...

In this paper we consider cardinality-constrained convex programs that minimize a convex function subject to a cardinality constraint and other linear constraints. This class of problems has found many applications, including portfolio selection, subset selection and compressed sensing. We propose a successive convex approximation method for this class of problems in which the cardinality funct...

We give an AC upper bound on the complexity of rst-oder queries over (in nite) databases de ned by restricted linear constraints. This result enables us to deduce the non-expressibility of various usual queries, such as the parity of the cardinality of a set or the connectivity of a graph in rst-order logic with linear constraints.

k Abstract. We give an AC 0 upper bound on the complexity of rst-oder queries over (innnite) databases deened by restricted linear constraints. This result enables us to deduce the non-expressibility of various usual queries, such as the parity of the cardinality of a set or the connectivity of a graph in rst-order logic with linear constraints over the reals.

Accurately estimating the cardinality of aggregate views is crucial for logical and physical design of data warehouses. While the warehouse is under development and data are not available yet, the approaches based on accessing data cannot be adopted. This paper reports on the progress of an ongoing research aimed at devising a comprehensive approach to estimate the cardinality of views based on...

Abs t r ac t . In this paper we use the cardinality to increase the expressiveness efficiency of propositional calculus and improve the efficiency of resolution methods. Hence to express propositional problems and logical constraints we introduce the pair formulas (p, 15) which mean that "at least p literals among those of a list Z: are true". This makes a generalization of propositional clause...

In this work we propose a MaxSAT formulation for the problem of scheduling business-to-business meetings. We identify some implied constraints and provide distinct encodings of the used cardinality constraints. The experimental results show that the proposed technique outperforms previous existing approaches on this problem.

We describe soft versions of the global cardinality constraint and the regular constraint, with efficient filtering algorithms maintaining domain consistency. For both constraints, the softening is achieved by augmenting the underlying graph. The softened constraints can be used to extend the meta-constraint framework for over-constrained problems proposed by Petit, Régin and Bessière.