A Permutation Algorithm for the Linear 0-1 Programming Model

This paper presents a new method, the permutation algorithm, for solving the linear 0-1 programming model. In this algorithm, the unconstrained solutions are permuted in a special order according to the absolute values of variable coefficients of the objective function so as to search the optimum solution in the aggregate of minimums with an accelerated convergence speed.