ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2012.08738
  4. Cited By
Pareto Optimization for Subset Selection with Dynamic Partition Matroid
  Constraints

Pareto Optimization for Subset Selection with Dynamic Partition Matroid Constraints

16 December 2020
A. Do
Frank Neumann
ArXiv (abs)PDFHTML

Papers citing "Pareto Optimization for Subset Selection with Dynamic Partition Matroid Constraints"

4 / 4 papers shown
Title
Benchmarking Algorithms for Submodular Optimization Problems Using
  IOHProfiler
Benchmarking Algorithms for Submodular Optimization Problems Using IOHProfiler
Frank Neumann
Aneta Neumann
Chao Qian
Viet Anh Do
Jacob De Nobel
Diederick Vermetten
Saba Sadeghi Ahouei
Furong Ye
Hongya Wang
Thomas Bäck
69
5
0
02 Feb 2023
Result Diversification by Multi-objective Evolutionary Algorithms with
  Theoretical Guarantees
Result Diversification by Multi-objective Evolutionary Algorithms with Theoretical Guarantees
Chao Qian
Danqin Liu
Zhi Zhou
28
14
0
18 Oct 2021
Multi-objective Evolutionary Algorithms are Generally Good: Maximizing
  Monotone Submodular Functions over Sequences
Multi-objective Evolutionary Algorithms are Generally Good: Maximizing Monotone Submodular Functions over Sequences
Chao Qian
Danyang Liu
Chao Feng
K. Tang
49
13
0
20 Apr 2021
Multi-objective Evolutionary Algorithms are Still Good: Maximizing
  Monotone Approximately Submodular Minus Modular Functions
Multi-objective Evolutionary Algorithms are Still Good: Maximizing Monotone Approximately Submodular Minus Modular Functions
Chao Qian
50
23
0
12 Oct 2019
1