Less is more approach: basic variable neighborhood search for the obnoxious <i>p</i>‐median problem (Q6066720)
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: Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem |
scientific article; zbMATH DE number 7766433
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Less is more approach: basic variable neighborhood search for the obnoxious <i>p</i>‐median problem |
scientific article; zbMATH DE number 7766433 |
Statements
Less is more approach: basic variable neighborhood search for the obnoxious <i>p</i>‐median problem (English)
0 references
16 November 2023
0 references
heuristic
0 references
less is more
0 references
obnoxious location
0 references
heap data structure
0 references
facility best improvement
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9276092
0 references
0.9093476
0 references
0.8921246
0 references
0.8889187
0 references
0.8844818
0 references
0.8817005
0 references
0.88052535
0 references
0.88038254
0 references
0.87735593
0 references
