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. 2104.13133
  4. Cited By
Breeding Diverse Packings for the Knapsack Problem by Means of
  Diversity-Tailored Evolutionary Algorithms

Breeding Diverse Packings for the Knapsack Problem by Means of Diversity-Tailored Evolutionary Algorithms

27 April 2021
Jakob Bossek
Aneta Neumann
Frank Neumann
ArXivPDFHTML

Papers citing "Breeding Diverse Packings for the Knapsack Problem by Means of Diversity-Tailored Evolutionary Algorithms"

5 / 5 papers shown
Title
Rigorous Runtime Analysis of Diversity Optimization with GSEMO on
  OneMinMax
Rigorous Runtime Analysis of Diversity Optimization with GSEMO on OneMinMax
Denis Antipov
Aneta Neumann
Frank Neumann
21
6
0
14 Jul 2023
Coevolutionary Pareto Diversity Optimization
Coevolutionary Pareto Diversity Optimization
Aneta Neumann
Denis Antipov
Frank Neumann
20
10
0
12 Apr 2022
Evolutionary Diversity Optimisation for The Traveling Thief Problem
Evolutionary Diversity Optimisation for The Traveling Thief Problem
Adel Nikfarjam
Aneta Neumann
Frank Neumann
11
15
0
06 Apr 2022
Niching-based Evolutionary Diversity Optimization for the Traveling
  Salesperson Problem
Niching-based Evolutionary Diversity Optimization for the Traveling Salesperson Problem
A. Do
M. Guo
Aneta Neumann
Frank Neumann
14
4
0
25 Jan 2022
On the Use of Quality Diversity Algorithms for The Traveling Thief
  Problem
On the Use of Quality Diversity Algorithms for The Traveling Thief Problem
Adel Nikfarjam
Aneta Neumann
Frank Neumann
16
17
0
16 Dec 2021
1