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. 2102.00941
  4. Cited By
Fast Greedy Subset Selection from Large Candidate Solution Sets in
  Evolutionary Multi-objective Optimization

Fast Greedy Subset Selection from Large Candidate Solution Sets in Evolutionary Multi-objective Optimization

1 February 2021
Weiyu Chen
H. Ishibuchi
Ke Shang
ArXiv (abs)PDFHTML

Papers citing "Fast Greedy Subset Selection from Large Candidate Solution Sets in Evolutionary Multi-objective Optimization"

5 / 5 papers shown
Title
When to Truncate the Archive? On the Effect of the Truncation Frequency in Multi-Objective Optimisation
When to Truncate the Archive? On the Effect of the Truncation Frequency in Multi-Objective Optimisation
Zhiji Cui
Zimin Liang
Lie Meng Pang
H. Ishibuchi
Mingxing Li
82
0
0
02 Apr 2025
On Finding Bi-objective Pareto-optimal Fraud Prevention Rule Sets for
  Fintech Applications
On Finding Bi-objective Pareto-optimal Fraud Prevention Rule Sets for Fintech Applications
Chengyao Wen
Yin Lou
13
0
0
02 Nov 2023
Effects of Archive Size on Computation Time and Solution Quality for
  Multi-Objective Optimization
Effects of Archive Size on Computation Time and Solution Quality for Multi-Objective Optimization
Tianye Shu
Ke Shang
H. Ishibuchi
Yang Nan
27
6
0
07 Sep 2022
Benchmarking Subset Selection from Large Candidate Solution Sets in
  Evolutionary Multi-objective Optimization
Benchmarking Subset Selection from Large Candidate Solution Sets in Evolutionary Multi-objective Optimization
Ke Shang
Tianye Shu
H. Ishibuchi
Yang Nan
Lie Meng Pang
66
8
0
18 Jan 2022
Clustering-Based Subset Selection in Evolutionary Multiobjective
  Optimization
Clustering-Based Subset Selection in Evolutionary Multiobjective Optimization
Weiyu Chen
H. Ishibuchi
Ke Shang
22
12
0
19 Aug 2021
1