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. 2404.11907
  4. Cited By
Sampling-based Pareto Optimization for Chance-constrained Monotone
  Submodular Problems

Sampling-based Pareto Optimization for Chance-constrained Monotone Submodular Problems

18 April 2024
Xiankun Yan
Aneta Neumann
Frank Neumann
ArXivPDFHTML

Papers citing "Sampling-based Pareto Optimization for Chance-constrained Monotone Submodular Problems"

4 / 4 papers shown
Title
Weighted-Scenario Optimisation for the Chance Constrained Travelling Thief Problem
Weighted-Scenario Optimisation for the Chance Constrained Travelling Thief Problem
Thilina Pathirage Don
Aneta Neumann
Frank Neumann
36
0
0
01 May 2025
Sliding Window Bi-Objective Evolutionary Algorithms for Optimizing
  Chance-Constrained Monotone Submodular Functions
Sliding Window Bi-Objective Evolutionary Algorithms for Optimizing Chance-Constrained Monotone Submodular Functions
Xiankun Yan
Anneta Neumann
Frank Neumann
29
1
0
13 Jul 2024
Evolving Reliable Differentiating Constraints for the Chance-constrained
  Maximum Coverage Problem
Evolving Reliable Differentiating Constraints for the Chance-constrained Maximum Coverage Problem
Saba Sadeghi Ahouei
Jacob De Nobel
Aneta Neumann
Thomas Bäck
Frank Neumann
AI4TS
29
4
0
29 May 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
24
6
0
09 Apr 2024
1