The following pages link to The maximal-dispersion problem (Q3991284):
Displaying 15 items.
- Construction and improvement algorithms for dispersion problems (Q726217) (← links)
- Approximate solutions of continuous dispersion problems (Q816409) (← links)
- The discrete p-dispersion problem (Q915643) (← links)
- Integer-friendly formulations for the \(r\)-separation problem (Q1268268) (← links)
- A comparison of \(p\)-dispersion heuristics (Q1342949) (← links)
- MILP models for the selection of a small set of well-distributed points (Q1727947) (← links)
- Solving multiple criteria choice problems by interactive trichotomy segmentation (Q1807938) (← links)
- A linear time approximation scheme for computing geometric maximum \(k\)-star (Q1942028) (← links)
- The conditional \(p\)-dispersion problem (Q2046325) (← links)
- The maximal dispersion problem and the ``first point outside the neighbourhood'' heuristic (Q2638928) (← links)
- Heuristic and Special Case Algorithms for Dispersion Problems (Q4301294) (← links)
- Solving the Continuous <i>p</i>-Dispersion Problem Using Non-linear Programming (Q4838220) (← links)
- Lagrangian solution of maximum dispersion problems (Q4949160) (← links)
- The repeated <i>p</i>-dispersion problem (Q6155626) (← links)
- An adaptive factorized Nyström preconditioner for regularized kernel matrices (Q6575352) (← links)