Parameterized algorithms and complexity for the traveling purchaser problem and its variants (Q2084609)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7603267
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterized algorithms and complexity for the traveling purchaser problem and its variants |
scientific article; zbMATH DE number 7603267 |
Statements
Parameterized algorithms and complexity for the traveling purchaser problem and its variants (English)
0 references
18 October 2022
0 references
traveling purchaser problem
0 references
fixed-parameter tractable
0 references
dynamic programming
0 references
parameterized complexity
0 references
0 references
0 references
0 references
0.8674988746643066
0 references
0.847404956817627
0 references
0.8435483574867249
0 references
0.8135087490081787
0 references
0.8048229813575745
0 references
