Transforming arc routing into node routing problems (Q1820685): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users 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
In more languages
ConfigureLanguage | Label | Description | Also known as |
---|---|---|---|
English | Transforming arc routing into node routing problems |
scientific article |
Statements
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.