Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants (Q2108113)
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: Exploiting flat subspaces in local search for p-center problem and two fault-tolerant variants |
scientific article; zbMATH DE number 7634072
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants |
scientific article; zbMATH DE number 7634072 |
Statements
Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants (English)
0 references
19 December 2022
0 references
flat subspace
0 references
heuristic function
0 references
local search
0 references
metaheuristic
0 references
move operation
0 references
\(p\)-center problem
0 references
search space
0 references
0 references
0 references
0 references
0 references
0.8387414
0 references
0.8352816
0 references
0.8333484
0 references
0.82073736
0 references
0.8183203
0 references
0.8183191
0 references
0.8178913
0 references
0.8160806
0 references
