Pages that link to "Item:Q513174"
From MaRDI portal
The following pages link to Heuristic solution approaches for the maximum minsum dispersion problem (Q513174):
Displaying 12 items.
- GRASP and path relinking for the equitable dispersion problem (Q336711) (← links)
- Maxminmin \(p\)-dispersion problem: a variable neighborhood search approach (Q337222) (← links)
- Exact algorithms for the max-min dispersion problem (Q777304) (← links)
- Effective methods for solving the bi-criteria \(p\)-center and \(p\)-dispersion problem (Q1628040) (← links)
- Solving the maximum min-sum dispersion by alternating formulations of two different problems (Q1753455) (← links)
- A hybrid heuristic for the maximum dispersion problem (Q2028755) (← links)
- Measuring diversity. A review and an empirical analysis (Q2029033) (← links)
- An exact semidefinite programming approach for the max-mean dispersion problem (Q2410030) (← links)
- The maximal dispersion problem and the ``first point outside the neighbourhood'' heuristic (Q2638928) (← 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)
- Heuristics for the capacitated dispersion problem (Q6070413) (← links)
