Number partitioning is a classical NP-hard combinatorial optimization problem, whose solution is challenging for both exact and approximative methods. This work presents a new algorithm for number partitioning, based on ideas drawn from tree search, breadth first search, and beam search. A new...

A type of non-Hermitian generalization of quantum mechanics is discussed. We introduce an imaginary vector potential to the Hamiltonian of systems such as Anderson-localization systems and mesoscopic systems. In these systems the imaginary part of the wave number of the eigenfunction asymptote...