Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem (Q548680): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
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
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10288-011-0153-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2153278891 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the travelling repairman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem with cumulative costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum latency problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic for the vehicle routing problem with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic heuristic for a computationally difficult set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy randomized adaptive search procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Delivery Man Problem and Cumulative Matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the traveling repairman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4495203 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search: Principles and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A GRASP for the Vehicle Routing Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new formulation for the traveling deliveryman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective memetic algorithm for the cumulative capacitated vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time algorithms for some minimum latency problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for the minimum latency problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:30, 4 July 2024

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
    0 references
    0 references
    0 references
    0 references
    0 references
    30 June 2011
    0 references
    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
    0 references