Good solutions to discrete noxious location problems via metaheuristics (Q689250)
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: Good solutions to discrete noxious location problems via metaheuristics |
scientific article; zbMATH DE number 445040
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Good solutions to discrete noxious location problems via metaheuristics |
scientific article; zbMATH DE number 445040 |
Statements
Good solutions to discrete noxious location problems via metaheuristics (English)
0 references
20 December 1993
0 references
simulated annealing
0 references
tabu search
0 references
noxious facility location
0 references
\(p\)- dispersion
0 references
\(p\)-defense-sum
0 references
semi-greedy heuristic
0 references
0 references
0 references
0.86316496
0 references
0.8325564
0 references
0 references
0.82621086
0 references
0.82059145
0 references
