Maxminmin \(p\)-dispersion problem: a variable neighborhood search approach (Q337222)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Maxminmin p-dispersion problem: a variable neighborhood search approach |
scientific article; zbMATH DE number 6650748
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maxminmin \(p\)-dispersion problem: a variable neighborhood search approach |
scientific article; zbMATH DE number 6650748 |
Statements
Maxminmin \(p\)-dispersion problem: a variable neighborhood search approach (English)
0 references
10 November 2016
0 references
combinatorial optimization
0 references
dispersion problems
0 references
metaheuristics
0 references
variable neighborhood search
0 references
0.8847175
0 references
0.88091767
0 references
0.8787763
0 references
0.87662554
0 references
0.8754292
0 references
0.8682145
0 references
