Pages that link to "Item:Q646655"
From MaRDI portal
The following pages link to A simple and effective algorithm for the MaxMin diversity problem (Q646655):
Displaying 19 items.
- Maxminmin \(p\)-dispersion problem: a variable neighborhood search approach (Q337222) (← links)
- A tabu search based memetic algorithm for the Max-Mean dispersion problem (Q342388) (← links)
- Construction and improvement algorithms for dispersion problems (Q726217) (← links)
- A heuristic approach for the max-min diversity problem based on max-clique (Q1010298) (← links)
- GRASP and path relinking for the max-min diversity problem (Q1038285) (← links)
- Computational aspects of the maximum diversity problem (Q1360111) (← links)
- Effective metaheuristic algorithms for the minimum differential dispersion problem (Q1751715) (← links)
- A new compact formulation for the discrete \(p\)-dispersion problem (Q1752169) (← links)
- Solving the maximum min-sum dispersion by alternating formulations of two different problems (Q1753455) (← links)
- Measuring diversity. A review and an empirical analysis (Q2029033) (← links)
- \(t\)-linearization for the maximum diversity problem (Q2230803) (← links)
- A hybrid metaheuristic of integrating estimation of distribution algorithm with Tabu search for the max-mean dispersion problem (Q2298725) (← links)
- A hybrid metaheuristic method for the maximum diversity problem (Q2356110) (← links)
- A branch and bound algorithm for the maximum diversity problem (Q2379521) (← links)
- Memetic self-adaptive evolution strategies applied to the maximum diversity problem (Q2448149) (← 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)
- On solving simplified diversified top-\(k\,s\)-plex problem (Q6164387) (← links)
