On a routing and scheduling problem concerning multiple edge traversals in graphs (Q5318269): Difference between revisions
From MaRDI portal
Set profile property. |
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.1002/net.20073 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4239485446 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4834367 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4510100 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximation Algorithms for Some Postman Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4702188 / rank | |||
Normal rank | |||
Latest revision as of 15:32, 10 June 2024
scientific article; zbMATH DE number 2207080
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On a routing and scheduling problem concerning multiple edge traversals in graphs |
scientific article; zbMATH DE number 2207080 |
Statements
On a routing and scheduling problem concerning multiple edge traversals in graphs (English)
0 references
22 September 2005
0 references
arc routing problems
0 references
network routing
0 references
Chinese postman problem
0 references
rural postman problem
0 references
