Pages that link to "Item:Q1268271"
From MaRDI portal
The following pages link to The use of dynamic programming in genetic algorithms for permutation problems (Q1268271):
Displaying 8 items.
- The robust set covering problem with interval data (Q367647) (← links)
- Multiprogramming genetic algorithm for optimization problems with permutation property (Q870194) (← links)
- A memetic algorithm for multi-objective dynamic location problems (Q960114) (← links)
- Hybrid genetic algorithm for optimization problems with permutation property (Q1886509) (← links)
- Genetic algorithms for a supply management problem: MIP-recombination vs greedy decoder (Q2378418) (← 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)
- Hybridizations of evolutionary algorithms with large neighborhood search (Q6158769) (← links)
