Sales‐delivery man problems on treelike networks (Q4698228): 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.3230250204 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1982148583 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: P-Complete Approximation Problems / rank | |||
Normal rank | |||
Latest revision as of 14:26, 23 May 2024
scientific article; zbMATH DE number 755102
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sales‐delivery man problems on treelike networks |
scientific article; zbMATH DE number 755102 |
Statements
Sales‐delivery man problems on treelike networks (English)
0 references
18 March 1996
0 references
trees
0 references
cactus networks
0 references
polynomial algorithms
0 references
multiserver variants
0 references
NP- complete
0 references
delivery man problem
0 references
