AN ASSIGNMENT-BASED LOCAL SEARCH METHOD FOR SOLVING VEHICLE ROUTING PROBLEMS (Q4675892): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The multi-trip vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improvement heuristics for the vehicle routing problem based on simulated annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A shortest augmenting path algorithm for dense and sparse linear assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Solutions of the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of Several Heuristics for the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerated branch exchange heuristics for symmetric traveling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems / rank
 
Normal rank

Latest revision as of 11:08, 10 June 2024

scientific article; zbMATH DE number 2166014
Language Label Description Also known as
English
AN ASSIGNMENT-BASED LOCAL SEARCH METHOD FOR SOLVING VEHICLE ROUTING PROBLEMS
scientific article; zbMATH DE number 2166014

    Statements