By Topic

Neural networks for solving the quadratic 0-1 programming problem under linear constraints

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Aourid, M. ; Dept. of Electr. Eng., Ecole Polytech. de Montreal, Que., Canada ; Kaminska, B.

An extension of the Boolean neural network (BNN) is presented to solve a quadratic 0-1 programming problem under linear constraints. The network is called a QBNN (quadratic Boolean neural network). To design the QBNN, some theoretical results from the integer programming domain are used. This shows the connection between nonlinear and integer programming. The linear constraints are also incorporated into the quadratic objective function by using the penalty methods with a variable parameter. This allows the transformation of the constrained problem into an unconstrained one. The total objective function obtained is then fixed as the energy function for the QBNN. Some simulation results are given to show that the system finds a good optimal solution within a few neural time constants

Published in:

Neural Networks, 1993., IEEE International Conference on

Date of Conference: