Improving the quality of heuristic solutions for the capacitated vertex \(p\)-center problem through iterated greedy local search with variable neighborhood descent (Q337640): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90B80 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C27 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C59 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6650913 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
combinatorial optimization | |||
Property / zbMATH Keywords: combinatorial optimization / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
discrete location | |||
Property / zbMATH Keywords: discrete location / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
capacitated \(p\)-center problem | |||
Property / zbMATH Keywords: capacitated \(p\)-center problem / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
metaheuristics | |||
Property / zbMATH Keywords: metaheuristics / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
iterated greedy local search | |||
Property / zbMATH Keywords: iterated greedy local search / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
variable neighborhood descent | |||
Property / zbMATH Keywords: variable neighborhood descent / rank | |||
Normal rank |
Revision as of 05:28, 28 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
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 |
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