Pages that link to "Item:Q2975431"
From MaRDI portal
The following pages link to Optimal recombination in genetic algorithms for combinatorial optimization problems: Part II (Q2975431):
Displaying 8 items.
- 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)
- Genetic Algorithm with Optimal Recombination for the Asymmetric Travelling Salesman Problem (Q3297452) (← links)
- Optimal recombination algorithms for generalized chains (Q3514848) (← links)
- On solving Travelling Salesman Problem with Vertex Requisitions (Q4987704) (← links)
- An efficient genetic algorithm for the Uncapacitated r-allocation p-hub maximal covering problem (Q4987784) (← links)
- Foundations of Genetic Algorithms (Q5703884) (← links)
- Hybridizations of evolutionary algorithms with large neighborhood search (Q6158769) (← links)