The Performance of Discrete Neural Network on Combinatorial Optimization Problem
Youmei Li · Journal of Shanxi University · 2002
The performance of discrete neural network is considered when it is applied to combinatorial optimization problem with inequalities constraints,especially Knapsack problem is used to illustrate the idea we have proposed.Two ways are used to design the network,the one is the direct energy descent method,and the other is the gradient descent method.Their performance are verified by several examples.Though the models'ability is limited,but it still can provide some useful information for related problem.