Pages that link to "Item:Q2975423"
From MaRDI portal
The following pages link to Optimal recombination in genetic algorithms for combinatorial optimization problems: Part I (Q2975423):
Displaying 9 items.
- Genetic algorithms for optimized re-triangulation in the context of reverse engineering. (Q1401746) (← links)
- VNS-based heuristic with an exponential neighborhood for the server load balancing problem (Q2631229) (← links)
- On complexity of optimal recombination for flowshop scheduling problems (Q3186862) (← links)
- Optimal recombination algorithms for generalized chains (Q3514848) (← links)
- Hitting times of local and global optima in genetic algorithms with very high selection pressure (Q4987699) (← links)
- An efficient genetic algorithm for the Uncapacitated r-allocation p-hub maximal covering problem (Q4987784) (← links)
- Foundations of Genetic Algorithms (Q5703884) (← links)
- Quasi-optimal recombination operator (Q6084518) (← links)
- Hybridizations of evolutionary algorithms with large neighborhood search (Q6158769) (← links)