Pages that link to "Item:Q342388"
From MaRDI portal
The following pages link to A tabu search based memetic algorithm for the Max-Mean dispersion problem (Q342388):
Displayed 11 items.
- Multiple phase tabu search for bipartite Boolean quadratic programming with partitioned variables (Q1628128) (← links)
- Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem (Q1755228) (← links)
- Methods for improving the efficiency of swarm optimization algorithms. A survey (Q1982839) (← links)
- A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks (Q2053830) (← links)
- An opposition-based memetic algorithm for the maximum quasi-clique problem (Q2184091) (← links)
- A hybrid metaheuristic of integrating estimation of distribution algorithm with Tabu search for the max-mean dispersion problem (Q2298725) (← links)
- An exact semidefinite programming approach for the max-mean dispersion problem (Q2410030) (← links)
- Tabu search guided by reinforcement learning for the max-mean dispersion problem (Q2666721) (← links)
- A two-phase intensification tabu search algorithm for the maximum min-sum dispersion problem (Q2669523) (← links)
- A review on discrete diversity and dispersion maximization from an OR perspective (Q2670513) (← links)
- Reinforcement learning enhanced multi-neighborhood tabu search for the max-mean dispersion problem (Q2673245) (← links)