Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem (Q548680): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
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: 5915210 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
traveling repairman problem | |||
Property / zbMATH Keywords: traveling repairman problem / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
minimum latency problem | |||
Property / zbMATH Keywords: minimum latency problem / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
variable neighborhood descent | |||
Property / zbMATH Keywords: variable neighborhood descent / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
variable neighborhood search | |||
Property / zbMATH Keywords: variable neighborhood search / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
GRASP | |||
Property / zbMATH Keywords: GRASP / rank | |||
Normal rank |
Revision as of 13:04, 1 July 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem |
scientific article |
Statements
Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem (English)
0 references
30 June 2011
0 references
traveling repairman problem
0 references
minimum latency problem
0 references
variable neighborhood descent
0 references
variable neighborhood search
0 references
GRASP
0 references