Multi-Objective Evolutionary Algorithms with Sliding Window Selection for the Dynamic Chance-Constrained Knapsack Problem

Documenti analoghi

• Evolutionary Algorithm for Chance Constrained Quadratic Multiple Knapsack Problem
  di: Perera, Kokila Kasuni, et al.
  Pubblicazione: (2025)
• Using 3-Objective Evolutionary Algorithms for the Dynamic Chance Constrained Knapsack Problem
  di: Pathiranage, Ishara Hewa, et al.
  Pubblicazione: (2024)
• Sliding Window Bi-Objective Evolutionary Algorithms for Optimizing Chance-Constrained Monotone Submodular Functions
  di: Yan, Xiankun, et al.
  Pubblicazione: (2024)
• Trust Region-Based Bayesian Optimisation to Discover Diverse Solutions
  di: Perera, Kokila Kasuni, et al.
  Pubblicazione: (2025)
• Optimizing Monotone Chance-Constrained Submodular Functions Using Evolutionary Multi-Objective Algorithms
  di: Neumann, Aneta, et al.
  Pubblicazione: (2020)