By Topic

Mixed-integer Algorithms for the (0,1) Knapsack Problem

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
$33 $33
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)
M. M. Guignard ; Computing Laboratory, Department of Computer Science, Electronics, Electrotechnics and Automata, University of Lille, France ; K. Spielberg

An enumerative scheme is presented for the (0,1) knapsack problem as a specialization of the state enumeration method. Techniques are explored for rendering search procedures more efficient by systematic use of information generated during execution of the algorithm. The inequalities of Benders and Gomory-Johnson are exploited to yield implicit enumeration tests in the special case of the knapsack problem. In a comparative study of eight algorithms and of the utility of certain approximations and inequalities, computational results are given for twelve knapsack problems, each having ten (0,1) variables. The effectiveness of these enumerative algorithms are thus tested in a relatively simple framework.

Note: The Institute of Electrical and Electronics Engineers, Incorporated is distributing this Article with permission of the International Business Machines Corporation (IBM) who is the exclusive owner. The recipient of this Article may not assign, sublicense, lease, rent or otherwise transfer, reproduce, prepare derivative works, publicly display or perform, or distribute the Article.  

Published in:

IBM Journal of Research and Development  (Volume:16 ,  Issue: 4 )