The following pages link to (Q3070929):
Displaying 8 items.
- Construction and improvement algorithms for dispersion problems (Q726217) (← links)
- Solving huge size instances of the optimal diversity management problem (Q844532) (← 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)
- A review on algorithms for maximum clique problems (Q2630214) (← links)
- A two-phase tabu search based evolutionary algorithm for the maximum diversity problem (Q2673240) (← links)
- Approximation Guarantees for Max Sum and Max Min Facility Dispersion with Parameterised Triangle Inequality and Applications in Result Diversification (Q5274808) (← links)