The following pages link to (Q5321485):
Displaying 10 items.
- Genetic algorithm for combinatorial path planning: the subtour problem (Q541476) (← links)
- Memetic algorithm based on improved inver-over operator and Lin-Kernighan local search for the Euclidean traveling salesman problem (Q660966) (← links)
- Optimizing ontology alignments through a memetic algorithm using both MatchFmeasure and unanimous improvement ratio (Q892192) (← links)
- Estimation-based metaheuristics for the probabilistic traveling salesman problem (Q976010) (← links)
- An effective local search for the maximum clique problem (Q1041822) (← links)
- An efficient local search for the feedback vertex set problem (Q1736593) (← links)
- A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem (Q2248551) (← links)
- Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers (Q2350870) (← links)
- Comparison of Tabu/2-opt heuristic and optimal tree search method for assignment problems (Q2903985) (← links)
- A gene-pool based genetic algorithm for TSP (Q4454481) (← links)
