This is the repository for an Operation Research article. It deals with the 0-1 Knapsack optimization problem, which is a classic NP-hard problem. I'm trying to explain the different algorithms used to tackle the problem. The accent is on the logistic applications.
I'm writing it in Italian first, then I'm going to translate it in English. Feel free to contribute. Knowledge is for everybody.
License: Modified 2-clauses BSD
Copyright (c) 2012, Paolo Gatti, all rights reserved. https://github.com/lordkrandel/Knapsack
Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * Redistributions of the article must retain the above copyright notice, this list of conditions and the following disclaimer. * Neither the name of the organization nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.
THIS ARTICLE IS PROVIDED BY Paolo Gatti ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.