New lower bound for the capacitated arc routing problem (Q2496046): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.cor.2005.02.015 / rank | |||
| 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 | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.COR.2005.02.015 / rank | |||
Normal rank | |||
Latest revision as of 01:09, 19 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New lower bound for the capacitated arc routing problem |
scientific article |
Statements
New lower bound for the capacitated arc routing problem (English)
0 references
30 June 2006
0 references
capacitated arc routing problem
0 references
lower bounds
0 references
