Pages that link to "Item:Q420829"
From MaRDI portal
The following pages link to On the approximation ability of evolutionary optimization with application to minimum set cover (Q420829):
Displaying 11 items.
- An analysis on recombination in multi-objective evolutionary optimization (Q490439) (← links)
- Performance analysis of the \((1+1)\) evolutionary algorithm for the multiprocessor scheduling problem (Q494929) (← links)
- Lower bounds for comparison based evolution strategies using VC-dimension and sign patterns (Q633835) (← links)
- Optimization methods for regularization-based ill-posed problems: a survey and a multi-objective framework (Q1712546) (← links)
- Time complexity analysis of evolutionary algorithms for 2-hop \((1,2)\)-minimum spanning tree problem (Q2238214) (← links)
- Performance analysis of randomised search heuristics operating with a fixed budget (Q2250996) (← links)
- Optimizing group learning: an evolutionary computing approach (Q2321327) (← links)
- Maximizing submodular or monotone approximately submodular functions by multi-objective evolutionary algorithms (Q2321329) (← links)
- A simulated evolution-based solution of the cover problem (Q2391718) (← links)
- On the analysis of the (1+1) evolutionary algorithm for the maximum leaf spanning tree problem (Q3451414) (← links)
- On the Use of the Dual Formulation for Minimum Weighted Vertex Cover in Evolutionary Algorithms (Q5738854) (← links)
