Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 4 of 4 for “"Cardinality constraint"”.

  1. Cardinality Constrained Optimization Problems

    … thesis, we examine optimization problems with a constraint that allows for only a certain number of variables to be nonzero. This constraint, which is called a cardinality constraint, has received considerable attention in a number of areas such as machine learning, statistics, computational …

    purdue-thes Repository record for Cardinality Constrained Optimization Problems (opens in a new tab)

  2. New results on some quadratic programming problems

    … contains two optimization problems with binary constraints. To solve these problems, we first explore some intrinsic relation between binary quadratic problem and data clustering. Then we utilize the explored relation to develop effective approximation algorithms. For example, the first problem …

    uiuc Repository record for New results on some quadratic programming problems (opens in a new tab)

  3. Vignettes on robust combinatorial optimization

    … all monotone submodular, subject to a cardinality constraint. We focus on the case where the number of objectives is super-constant yet much smaller than the cardinality of the chosen set. We propose several algorithms (including one with the best achievable asymptotic guarantee for the …

    mit Repository record for Vignettes on robust combinatorial optimization (opens in a new tab)

  4. Algorithms and complexity results for problems on fair division and imitation games

    … for the case of public goods subject to a cardinality constraint. We show that the NSW problem is NP-hard, even when the valuations are all binary. Next, we present a linear-factor approximation algorithm and polynomial time algorithms when the number of agents or the number of goods to be …

    uiuc Repository record for Algorithms and complexity results for problems on fair division and imitation games (opens in a new tab)