A Metaheuristic for the Periodic Location-Routing Problem (Q5391896): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-540-77903-2_25 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1536244764 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using clustering analysis in a capacitated location-routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved heuristic for the period vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The period routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search heuristic for periodic and multi-depot vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking / rank
 
Normal rank
Property / cites work
 
Property / cites work: The effect of ignoring routes when locating depots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic solutions to multi-depot location-routing problems / rank
 
Normal rank

Latest revision as of 22:32, 3 July 2024

scientific article; zbMATH DE number 5875888
Language Label Description Also known as
English
A Metaheuristic for the Periodic Location-Routing Problem
scientific article; zbMATH DE number 5875888

    Statements

    Identifiers