Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: A Branch-and-Price Algorithm for the Temporal Bin Packing Problem   We study an extension of the classical Bin Packing Problem, where each item
consumes the bin capacity during a given time window that depends on the item
itself. The problem asks for finding the minimum number of bins to pack all the
items while respecting the bin capacity at any time instant. A polynomial-size
formulation, an exponential-size formulation, and a number of lower and upper
bounds are studied. A branch-and-price algorithm for solving the
exponential-size formulation is introduced. An overall algorithm combining the
different methods is then proposed and tested trough extensive computational
experiments.

36
The categories of this paper are: cmp-lg
15
The categories of this paper are: nucl-ex
30
The categories of this paper are: q-alg
23
The categories of this paper are: solv-int
3
The categories of this paper are: physics
9
The categories of this paper are: nlin
21
The categories of this paper are: adap-org
33
The categories of this paper are: plasm-ph
7
The categories of this paper are: hep-th
16
The categories of this paper are: stat
28
The categories of this paper are: alg-geom
35
The categories of this paper are: mtrl-th
22
The categories of this paper are: chao-dyn
26
The categories of this paper are: bayes-an
24
The categories of this paper are: dg-ga
17
The categories of this paper are: q-fin