摘要
ＡＮＥＷＡＬＧＯＲＩＴＨＭＦＯＲＰＵＲＸＯ－１ＬＩＮＥＡＲＰＲＯＧＲＡＭＳＷＩＴＨＩＮＥＱＵＡＬＩＴＹＣＯＮＳＴＲＡＩＮＴＳ￥ＣＨＥＮＪｉａｎｆｅｉ（ＢｉｏｃｈｅｍｉｃａｌＥｎｇｉｎｅｅｒｉｎｇＳｔａｔｅＫｅｙＬａｂｏｒａｔｏｒｙ，Ｂｅｉｊｉｎｇ１０...
More and more attention has been paid to the HNN algorithm since it used by Hoplield and [1] to solve TSPs in 1985. However,the algorithm can only solve the pure 0-1 linear programs with equality constraints,and many test.[2] showed that it is unreliable.This paper proposes an HNN-type algorithm which can solve some pure 0-1 linear Programs with inequality constraints and gUarantee to find their 'near-optimal'solutions. Finally, an example is given.
