Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: On Solving Boolean Multilevel Optimization Problems   Many combinatorial optimization problems entail a number of hierarchically
dependent optimization problems. An often used solution is to associate a
suitably large cost with each individual optimization problem, such that the
solution of the resulting aggregated optimization problem solves the original
set of hierarchically dependent optimization problems. This paper starts by
studying the package upgradeability problem in software distributions.
Straightforward solutions based on Maximum Satisfiability (MaxSAT) and
pseudo-Boolean (PB) optimization are shown to be ineffective, and unlikely to
scale for large problem instances. Afterwards, the package upgradeability
problem is related to multilevel optimization. The paper then develops new
algorithms for Boolean Multilevel Optimization (BMO) and highlights a large
number of potential applications. The experimental results indicate that the
proposed algorithms for BMO allow solving optimization problems that existing
MaxSAT and PB solvers would otherwise be unable to solve.

3
The categories of this paper are: physics
12
The categories of this paper are: nucl-th
28
The categories of this paper are: alg-geom
26
The categories of this paper are: bayes-an
11
The categories of this paper are: hep-lat
15
The categories of this paper are: nucl-ex
4
The categories of this paper are: cond-mat
31
The categories of this paper are: ao-sci
27
The categories of this paper are: comp-gas
24
The categories of this paper are: dg-ga
20
The categories of this paper are: acc-phys
23
The categories of this paper are: solv-int
7
The categories of this paper are: hep-th
17
The categories of this paper are: q-fin
29
The categories of this paper are: funct-an
13
The categories of this paper are: quant-ph