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. 2405.18772
  4. Cited By
Evolving Reliable Differentiating Constraints for the Chance-constrained
  Maximum Coverage Problem

Evolving Reliable Differentiating Constraints for the Chance-constrained Maximum Coverage Problem

29 May 2024
Saba Sadeghi Ahouei
Jacob De Nobel
Aneta Neumann
Thomas Bäck
Frank Neumann
    AI4TS
ArXivPDFHTML

Papers citing "Evolving Reliable Differentiating Constraints for the Chance-constrained Maximum Coverage Problem"

3 / 3 papers shown
Title
Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms
Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms
Shuaiqun Pan
Yash J. Patel
Aneta Neumann
Frank Neumann
Thomas Bäck
Hao Wang
46
0
0
30 Jan 2025
Sampling-based Pareto Optimization for Chance-constrained Monotone
  Submodular Problems
Sampling-based Pareto Optimization for Chance-constrained Monotone Submodular Problems
Xiankun Yan
Aneta Neumann
Frank Neumann
21
5
0
18 Apr 2024
Using 3-Objective Evolutionary Algorithms for the Dynamic Chance
  Constrained Knapsack Problem
Using 3-Objective Evolutionary Algorithms for the Dynamic Chance Constrained Knapsack Problem
Ishara Hewa Pathiranage
Frank Neumann
Denis Antipov
Aneta Neumann
19
6
0
09 Apr 2024
1