An algorithm for the Rural Postman problem on a directed graph (Q3730368): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Nicos Christofides / rank | |||
| Property / author | |||
| Property / author: Nicos Christofides / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bfb0121091 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W74564317 / rank | |||
Normal rank | |||
Latest revision as of 11:04, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for the Rural Postman problem on a directed graph |
scientific article |
Statements
An algorithm for the Rural Postman problem on a directed graph (English)
0 references
1986
0 references
arc routing
0 references
NP-completeness
0 references
branch and bound
0 references
directed graph
0 references
Directed Rural Postman Problem
0 references
asymmetric travelling salesman
0 references
two stage heuristic
0 references
shortest arborescence
0 references
minimum cost flow
0 references
Lagrangian relaxation
0 references
tree search
0 references
Computational results
0 references
