An improved heuristic for the capacitated arc routing problem (Q1010273): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q5687196 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4510100 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated arc routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5287166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving capacitated arc routing problems using a transformation to the CVRP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate solutions for the capacitated arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Capacitated Arc Routing Problem: Lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting plane algorithm for the capacitated arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4289893 / 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: Competitive memetic algorithms for arc routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower and upper bounds for the mixed capacitated arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4836312 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Approaches to Solving the Traveling Salesman Problem / rank
 
Normal rank

Revision as of 10:29, 1 July 2024

scientific article
Language Label Description Also known as
English
An improved heuristic for the capacitated arc routing problem
scientific article

    Statements

    Identifiers