Improving the quality of heuristic solutions for the capacitated vertex \(p\)-center problem through iterated greedy local search with variable neighborhood descent (Q337640)
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: Improving the quality of heuristic solutions for the capacitated vertex p-center problem through iterated greedy local search with variable neighborhood descent |
scientific article; zbMATH DE number 6650913
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improving the quality of heuristic solutions for the capacitated vertex \(p\)-center problem through iterated greedy local search with variable neighborhood descent |
scientific article; zbMATH DE number 6650913 |
Statements
Improving the quality of heuristic solutions for the capacitated vertex \(p\)-center problem through iterated greedy local search with variable neighborhood descent (English)
0 references
10 November 2016
0 references
combinatorial optimization
0 references
discrete location
0 references
capacitated \(p\)-center problem
0 references
metaheuristics
0 references
iterated greedy local search
0 references
variable neighborhood descent
0 references
0 references
0 references
0.8706545233726501
0 references
0.8189066052436829
0 references
0.794425368309021
0 references
0.7654389142990112
0 references
