Pages that link to "Item:Q816409"
From MaRDI portal
The following pages link to Approximate solutions of continuous dispersion problems (Q816409):
Displaying 9 items.
- MILP models for the selection of a small set of well-distributed points (Q1727947) (← links)
- Repulsion-based p-dispersion with distance constraints in non-convex polygons (Q2070713) (← links)
- Computational experiments with heuristics for two nature reserve site selection problems (Q2384901) (← links)
- Space-filling Latin hypercube designs for computer experiments (Q2443402) (← links)
- Approximation algorithms for dispersion problems (Q2729645) (← links)
- Exact Second-Order Cone Programming Relaxations for Some Nonconvex Minimax Quadratic Optimization Problems (Q4609471) (← links)
- (Q4625279) (← links)
- Solving the Continuous <i>p</i>-Dispersion Problem Using Non-linear Programming (Q4838220) (← links)
- The repeated <i>p</i>-dispersion problem (Q6155626) (← links)