M. Aourid et B. Kaminska, MINIMIZATION OF THE 0-1 LINEAR-PROGRAMMING PROBLEM UNDER LINEAR CONSTRAINTS BY USING NEURAL NETWORKS - SYNTHESIS AND ANALYSIS, IEEE transactions on circuits and systems. 1, Fundamental theory andapplications, 43(5), 1996, pp. 421-425
In this brief, we propose a new design: a Boolean Neural Network (BNN)
for the 0-1 linear programming problem under inequalities constraints
by using the connection between concave programming and integer progr
amming problems, This connection is based on the concavity and penalty
function methods. The general objective function obtained, which comb
ines the objective function and constraints is fixed as the energy of
the system. The simulation results for the new BNN show that the syste
m converge rapidly within a few neural time constant.