Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: A Linearithmic Time Locally Optimal Algorithm for the Multiway Number
  Partition Optimization   We study the problem of multiway number partition optimization, which has a
myriad of applications in the decision, learning and optimization literature.
Even though the original multiway partitioning problem is NP-hard and requires
exponential time complexity algorithms; we formulate an easier optimization
problem, where our goal is to find a solution that is locally optimal. We
propose a linearithmic time complexity $O(N\log N)$ algorithm that can produce
such a locally optimal solution. Our method is robust against the input and
requires neither positive nor integer inputs.

23
The categories of this paper are: solv-int
36
The categories of this paper are: cmp-lg
9
The categories of this paper are: nlin
34
The categories of this paper are: chem-ph
12
The categories of this paper are: nucl-th
0
The categories of this paper are: hep-ph
15
The categories of this paper are: nucl-ex
13
The categories of this paper are: quant-ph
26
The categories of this paper are: bayes-an
14
The categories of this paper are: math-ph
16
The categories of this paper are: stat
6
The categories of this paper are: astro-ph
32
The categories of this paper are: atom-ph
20
The categories of this paper are: acc-phys
22
The categories of this paper are: chao-dyn
33
The categories of this paper are: plasm-ph