Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Climbing LP Algorithms   NP (search) problems allow easy correctness tests for solutions. Climbing
algorithms allow also easy assessment of how close to yielding the correct
answer is the configuration at any stage of their run. This offers a great
flexibility, as how sensible is any deviation from the standard procedures can
be instantly assessed.
  An example is the Dual Matrix Algorithm (DMA) for linear programming,
variations of which were considered by A.Y. Levin in 1965 and by Yamnitsky and
myself in 1982. It has little sensitivity to numerical errors and to the number
of inequalities. It offers substantial flexibility and, thus, potential for
further developments.

13
The categories of this paper are: quant-ph
3
The categories of this paper are: physics
35
The categories of this paper are: mtrl-th
28
The categories of this paper are: alg-geom
18
The categories of this paper are: econ
30
The categories of this paper are: q-alg
10
The categories of this paper are: q-bio
27
The categories of this paper are: comp-gas
34
The categories of this paper are: chem-ph
5
The categories of this paper are: gr-qc
7
The categories of this paper are: hep-th
29
The categories of this paper are: funct-an
14
The categories of this paper are: math-ph
15
The categories of this paper are: nucl-ex
33
The categories of this paper are: plasm-ph
32
The categories of this paper are: atom-ph