A variable neighborhood descent algorithm for a real waste collection problem with mobile depots (Q5488252): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q57568148, #quickstatements; #temporary_batch_1712260040974
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The periodic vehicle routing problem with intermediate facilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A guided local search heuristic for the capacitated arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variable neighborhood descent algorithm for a real waste collection problem with mobile depots / rank
 
Normal rank
Property / cites work
 
Property / cites work: The capacitated arc routing problem with intermediate facilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eulerian location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tabu Search Heuristic for the Capacitated arc Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive memetic algorithms for arc routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the flexibility of constraint programming models: From single to multiple time windows for the traveling salesman problem / rank
 
Normal rank

Revision as of 19:21, 24 June 2024

scientific article; zbMATH DE number 5054046
Language Label Description Also known as
English
A variable neighborhood descent algorithm for a real waste collection problem with mobile depots
scientific article; zbMATH DE number 5054046

    Statements

    Identifiers