New lower bound for the capacitated arc routing problem (Q2496046): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Capacitated arc routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transforming arc routing into node routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Capacitated Chinese Postman Problem: Lower Bounds and Solvable Cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: New lower bounds 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: NODE DUPLICATION LOWER BOUNDS FOR THE CAPACITATED ARC ROUTING PROBLEM / rank
 
Normal rank

Latest revision as of 17:48, 24 June 2024

scientific article
Language Label Description Also known as
English
New lower bound for the capacitated arc routing problem
scientific article

    Statements

    Identifiers