Transforming arc routing into node routing problems (Q1820685): Difference between revisions
From MaRDI portal
m rollbackEdits.php mass rollback Tag: Rollback |
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.1016/0305-0548(87)90065-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2081814459 / 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: An algorithm for the Rural Postman problem on a directed graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Capacitated arc routing problems / rank | |||
Normal rank | |||
Latest revision as of 18:07, 17 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Transforming arc routing into node routing problems |
scientific article |
Statements
Transforming arc routing into node routing problems (English)
0 references
1987
0 references
We describe how the capacitated arc routing problem can be formulated as a standard vehicle routing problem. This allows us to transform arc routing into node routing problems and, therefore, establishes the equivalence of these two classes of problems.
0 references
capacitated arc routing
0 references
vehicle routing
0 references
