Related references
Note: Only part of the references are listed.Greedy Hypervolume Subset Selection in the Three-Objective Case
Andreia P. Guerreiro et al.
GECCO'15: PROCEEDINGS OF THE 2015 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE (2015)
Fixed-Parameter Evolutionary Algorithms and the Vertex Cover Problem
Stefan Kratsch et al.
ALGORITHMICA (2013)
Black-Box Search by Unbiased Variation
Per Kristian Lehre et al.
ALGORITHMICA (2012)
Evolutionary Algorithms and Matroid Optimization Problems
Joachim Reichel et al.
ALGORITHMICA (2010)
Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models
Tobias Friedrich et al.
EVOLUTIONARY COMPUTATION (2010)
An Efficient Algorithm for Computing Hypervolume Contributions
Karl Bringmann et al.
EVOLUTIONARY COMPUTATION (2010)
On the Effect of Populations in Evolutionary Multi-Objective Optimisation
Oliver Giel et al.
EVOLUTIONARY COMPUTATION (2010)
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
Jon Lee et al.
MATHEMATICS OF OPERATIONS RESEARCH (2010)
On the Effects of Adding Objectives to Plateau Functions
Dimo Brockhoff et al.
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION (2009)
An efficient polynomial time approximation scheme for the constrained minimum spanning tree problem using matroid intersection
R Hassin et al.
SIAM JOURNAL ON COMPUTING (2004)
On the analysis of the (1+1) evolutionary algorithm
S Droste et al.
THEORETICAL COMPUTER SCIENCE (2002)
A combinatorial strongly polynomial algorithm for minimizing submodular functions
S Iwata et al.
JOURNAL OF THE ACM (2001)
Some optimal inapproximability results
J Håstad
JOURNAL OF THE ACM (2001)
Share Paper
