An algorithm for the hierarchical Chinese postman problem (Q1970425): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5687196 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4845365 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Postman tour on a graph with precedence relation on arcs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Matching, Euler tours and the Chinese postman / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Arc Routing Problems, Part I: The Chinese Postman Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Arc Routing Problems, Part II: The Rural Postman Problem / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 14:44, 29 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An algorithm for the hierarchical Chinese postman problem |
scientific article |
Statements
An algorithm for the hierarchical Chinese postman problem (English)
0 references
12 December 2000
0 references
hierarchical Chinese postman problem
0 references