New O(n²) dynamic programming algorithm for path-metric TTP tour optimization with fixed packing, plus NP-hardness on stars and constant-factor approximations for star and general metrics with linear costs.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
unclear 1representative citing papers
Introduces TTP with time windows, creates new benchmarks from existing TTP instances, and shows a new heuristic outperforms adapted TSP and TTP methods on many instances.
citing papers explorer
-
Effective Traveling for Metric Instances of the Traveling Thief Problem
New O(n²) dynamic programming algorithm for path-metric TTP tour optimization with fixed packing, plus NP-hardness on stars and constant-factor approximations for star and general metrics with linear costs.
-
The Traveling Thief Problem with Time Windows: Benchmarks and Heuristics
Introduces TTP with time windows, creates new benchmarks from existing TTP instances, and shows a new heuristic outperforms adapted TSP and TTP methods on many instances.