A New Method of Integer Linear Programming——Branch Direction Search Method

Article Contents

Article Navigation > Applied Mathematics and Mechanics > 1985 > 6(3): 277-284

Xia De-lin. A New Method of Integer Linear Programming——Branch Direction Search Method[J]. Applied Mathematics and Mechanics, 1985, 6(3): 277-284.

Citation:

Xia De-lin. A New Method of Integer Linear Programming——Branch Direction Search Method[J]. Applied Mathematics and Mechanics, 1985, 6(3): 277-284.

Citation:

Xia De-lin. A New Method of Integer Linear Programming——Branch Direction Search Method[J]. Applied Mathematics and Mechanics, 1985, 6(3): 277-284.

Abstract

An endeavour is made in this paper to present a new and simple ILP algorithm for optimization. It hos the most desirable features of robustness and fast convergence. The algorithm is successful in applying it to some problems arisen in engineering design.

[1]	Garfinkel,Robert,S.,Integer Programming,(1972).
[2]	Glover,Fred,Improved linear integer programming formulations of nonlinear integer problem,Decision Science,22,1(1975).