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 10 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)
- 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)
- A hybrid metaheuristic of integrating estimation of distribution algorithm with Tabu search for the max-mean dispersion problem (Q2298725) (← 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)
