Cart (Loading....) | Create Account
Close category search window

Minimization of the 0-1 linear programming problem under linear constraints by using neural networks: synthesis and analysis

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)

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 programming problems. This connection is based on the concavity and penalty function methods. The general objective function obtained, which combines the objective function and constraints is fixed as the energy of the system. The simulation results for the new BNN show that the system converge rapidly within a few neural time constant.

Published in:

Circuits and Systems I: Fundamental Theory and Applications, IEEE Transactions on  (Volume:43 ,  Issue: 5 )

Date of Publication:

May 1996

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.