Corpus ID: 19251434

On Multiset Selection With Size Constraints

  title={On Multiset Selection With Size Constraints},
  author={Chao Qian and Y. Zhang and Ke Tang and X. Yao},
  • Chao Qian, Y. Zhang, +1 author X. Yao
  • Published in AAAI 2018
  • Computer Science
  • This paper considers the multiset selection problem with size constraints, which arises in many real-world applications such as budget allocation. Previous studies required the objective function f to be submodular, while we relax this assumption by introducing the notion of the submodularity ratios (denoted by αf and βf ). We propose an anytime randomized iterative approach POMS, which maximizes the given objective f and minimizes the multiset size simultaneously. We prove that POMS using a… CONTINUE READING
    7 Citations
    Fast Evolutionary Algorithms for Maximization of Cardinality-Constrained Weakly Submodular Functions
    Sequence Selection by Pareto Optimization
    • 1
    • PDF
    Multi-objective Evolutionary Algorithms are Still Good: Maximizing Monotone Approximately Submodular Minus Modular Functions
    • Chao Qian
    • Computer Science, Medicine
    • Evolutionary Computation
    • 2019
    • PDF
    From Sets to Multisets: Provable Variational Inference for Probabilistic Integer Submodular Models
    • PDF
    Maximizing Monotone DR-submodular Continuous Functions by Derivative-free Optimization
    • PDF
    Fast Maximization of Non-Submodular, Monotonic Functions on the Integer Lattice
    • 15
    • PDF


    On Subset Selection with General Cost Constraints
    • 25
    • PDF
    Optimal Budget Allocation: Theoretical Guarantee and Efficient Algorithm
    • 75
    • Highly Influential
    • PDF
    Constrained Monotone $k$ -Submodular Function Maximization Using Multiobjective Evolutionary Algorithms With Theoretical Guarantee
    • 16
    • PDF
    Maximizing Submodular Functions under Matroid Constraints by Evolutionary Algorithms
    • 29
    • PDF
    Submodular Optimization with Routing Constraints
    • 62
    • PDF
    Online Submodular Welfare Maximization: Greedy is Optimal
    • 59
    • PDF
    An analysis of approximations for maximizing submodular set functions—I
    • 3,619
    • PDF
    Maximizing Monotone Submodular Functions over the Integer Lattice
    • 29
    • Highly Influential
    • PDF
    A Generalization of Submodular Cover via the Diminishing Return Property on the Integer Lattice
    • 52
    • PDF
    SIMPATH: An Efficient Algorithm for Influence Maximization under the Linear Threshold Model
    • A. Goyal, Wei Lu, L. Lakshmanan
    • Mathematics, Computer Science
    • 2011 IEEE 11th International Conference on Data Mining
    • 2011
    • 380
    • PDF