Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Packing While Traveling: Mixed Integer Programming for a Class of
  Nonlinear Knapsack Problems   Packing and vehicle routing problems play an important role in the area of
supply chain management. In this paper, we introduce a non-linear knapsack
problem that occurs when packing items along a fixed route and taking into
account travel time. We investigate constrained and unconstrained versions of
the problem and show that both are NP-hard. In order to solve the problems, we
provide a pre-processing scheme as well as exact and approximate mixed integer
programming (MIP) solutions. Our experimental results show the effectiveness of
the MIP solutions and in particular point out that the approximate MIP approach
often leads to near optimal results within far less computation time than the
exact approach.

20
The categories of this paper are: acc-phys
12
The categories of this paper are: nucl-th
33
The categories of this paper are: plasm-ph
28
The categories of this paper are: alg-geom
35
The categories of this paper are: mtrl-th
19
The categories of this paper are: eess
22
The categories of this paper are: chao-dyn
0
The categories of this paper are: hep-ph
23
The categories of this paper are: solv-int
16
The categories of this paper are: stat
15
The categories of this paper are: nucl-ex
9
The categories of this paper are: nlin
25
The categories of this paper are: patt-sol
24
The categories of this paper are: dg-ga
17
The categories of this paper are: q-fin
31
The categories of this paper are: ao-sci