Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: A Fully Polynomial Time Approximation Scheme for Packing While Traveling   Understanding the interactions between different combinatorial optimisation
problems in real-world applications is a challenging task. Recently, the
traveling thief problem (TTP), as a combination of the classical traveling
salesperson problem and the knapsack problem, has been introduced to study
these interactions in a systematic way. We investigate the underlying
non-linear packing while traveling (PWT) problem of the TTP where items have to
be selected along a fixed route. We give an exact dynamic programming approach
for this problem and a fully polynomial time approximation scheme (FPTAS) when
maximising the benefit that can be gained over the baseline travel cost. Our
experimental investigations show that our new approaches outperform current
state-of-the-art approaches on a wide range of benchmark instances.

30
The categories of this paper are: q-alg
19
The categories of this paper are: eess
36
The categories of this paper are: cmp-lg
33
The categories of this paper are: plasm-ph
32
The categories of this paper are: atom-ph
31
The categories of this paper are: ao-sci
3
The categories of this paper are: physics
11
The categories of this paper are: hep-lat
8
The categories of this paper are: hep-ex
10
The categories of this paper are: q-bio
2
The categories of this paper are: math
7
The categories of this paper are: hep-th
20
The categories of this paper are: acc-phys
16
The categories of this paper are: stat
23
The categories of this paper are: solv-int
24
The categories of this paper are: dg-ga