Search and delivery man problems: when are depth-first paths optimal? (Q2184055): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ejor.2020.02.026 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.EJOR.2020.02.026 / rank | |||
Normal rank | |||
Latest revision as of 09:32, 17 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Search and delivery man problems: when are depth-first paths optimal? |
scientific article |
Statements
Search and delivery man problems: when are depth-first paths optimal? (English)
0 references
27 May 2020
0 references
networks
0 references
depth-first search
0 references
delivery man problem
0 references
trees
0 references
0 references
0 references
