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

A Solution to the Strongly Correlated 0-1 Knapsack Problem by a Binary Branch and Bound Algorithm

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

4 Author(s)
Zavala-Diaz, J.C. ; FCAeI-UAEM Cuernavaca, Cuernavaca, Mexico ; Ruiz-Vanoye, J.A. ; Diaz-Parra, O. ; Hern'ndez-Aguilar, J.A.

In this paper is presented the Binary Branch-and-Bound Algorithm (BBBA) and its application to determine the solution of the 0-1 Knapsack Problem. The algorithm solves different instances (uncorrelated, weakly and strongly correlated) in time (Kn). The proposed algorithm was experimentally compared with the Pisinger Model, based on the obtained results it is demonstrated the ability of the proposed algorithm to solve problems that the Pisinger algorithm cannot solve.

Published in:

Computational Sciences and Optimization (CSO), 2012 Fifth International Joint Conference on

Date of Conference:

23-26 June 2012

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.