Pages that link to "Item:Q777304"
From MaRDI portal
The following pages link to Exact algorithms for the max-min dispersion problem (Q777304):
Displaying 12 items.
- Maxminmin \(p\)-dispersion problem: a variable neighborhood search approach (Q337222) (← links)
- Heuristic solution approaches for the maximum minsum dispersion problem (Q513174) (← links)
- Construction and improvement algorithms for dispersion problems (Q726217) (← links)
- Dispersing points on intervals (Q1706121) (← links)
- A hybrid heuristic for the maximum dispersion problem (Q2028755) (← links)
- An efficient low complexity algorithm for box-constrained weighted maximin dispersion problem (Q2031386) (← links)
- Repulsion-based p-dispersion with distance constraints in non-convex polygons (Q2070713) (← links)
- The maximal dispersion problem and the ``first point outside the neighbourhood'' heuristic (Q2638928) (← links)
- Efficient Algorithm for Computing the Triangle Maximizing the Length of Its Smallest Side Inside a Convex Polygon (Q5859625) (← links)
- Max-min dispersion on a line (Q5918519) (← links)
- Away from each other (Q6091146) (← links)
- Dispersion problem on a convex polygon (Q6602315) (← links)