{
    "info": {
        "author": "Paulo Kuong",
        "author_email": "paulo.kuong@gmail.com",
        "bugtrack_url": null,
        "classifiers": [
            "Development Status :: 3 - Alpha",
            "License :: OSI Approved :: MIT License",
            "Programming Language :: Python :: 3.4"
        ],
        "description": "| |Build Status|\r\n\r\nKnapsack01\r\n--------------\r\n\r\nGeneric 0-1 Knapsack Problem Solver.\r\n\r\n    | Given a set of items, each with a weight and a value, Knapsack01\r\n    | determine the number of each item to include in a collection so\r\n      that the\r\n    | total weight is less than or equal to a given limit and the total\r\n      value is\r\n    | as large as possible.\r\n\r\nRequirements\r\n------------\r\n\r\n-  Python 3.4 (tested)\r\n\r\nGoal\r\n----\r\n\r\n| The ultimate goal of this library is to provide a generic interface\r\n| for solving the Knapsack problem for variety of applications.\r\n\r\nCode sample\r\n-----------\r\n\r\n| Lets say, given the capacity (10) of a team and a list of Jira tickets\r\n  with\r\n| story points and priorities, I would like to know what tickets I want\r\n| to do in the next sprint. Note that you can put multiple parameters\r\n  for\r\n| evaluating the importance of each ticket.\r\n\r\n.. code:: python\r\n\r\n    from knapsack01.knapsack import Item\r\n    from knapsack01.knapsack import Knapsack\r\n\r\n    tickets = [\r\n        Item('A', 1, [1, 4, 8, 23, 6]),\r\n        Item('B', 3, [4]),\r\n        Item('C', 4, [5]),\r\n        Item('E', 5, [7])\r\n    ]\r\n    k = Knapsack(10)\r\n    k.items = tickets\r\n    jira_tickets_next_sprint = k.pick_items()\r\n\r\nContributors\r\n------------\r\n\r\n-  Paulo Kuong (`@pkuong`_)\r\n\r\n.. _@pkuong: https://github.com/paulokuong\r\n\r\n.. |Build Status| image:: https://travis-ci.org/paulokuong/knapsack01.svg?branch=master\r\n   :target: https://travis-ci.org/paulokuong/knapsack01",
        "description_content_type": null,
        "docs_url": "https://pythonhosted.org/knapsack01/",
        "download_url": "UNKNOWN",
        "downloads": {
            "last_day": -1,
            "last_month": -1,
            "last_week": -1
        },
        "home_page": "https://github.com/pkuong/knapsack01",
        "keywords": "algorithm knapsack dynamic programming",
        "license": "MIT",
        "maintainer": "",
        "maintainer_email": "",
        "name": "knapsack01",
        "package_url": "https://pypi.org/project/knapsack01/",
        "platform": "UNKNOWN",
        "project_url": "https://pypi.org/project/knapsack01/",
        "project_urls": {
            "Download": "UNKNOWN",
            "Homepage": "https://github.com/pkuong/knapsack01"
        },
        "release_url": "https://pypi.org/project/knapsack01/0.1/",
        "requires_dist": null,
        "requires_python": null,
        "summary": "Solving 0/1 Knapsack Problem",
        "version": "0.1"
    },
    "last_serial": 2344726,
    "releases": {
        "0.0.1": [
            {
                "comment_text": "",
                "digests": {
                    "md5": "d5dc722ef7209cc57b2e0056c2dc322a",
                    "sha256": "3a243d63d5ec1e766fe63f1c16959309c5091045f027264244d8b68eddf8e261"
                },
                "downloads": -1,
                "filename": "knapsack01-0.0.1.tar.gz",
                "has_sig": false,
                "md5_digest": "d5dc722ef7209cc57b2e0056c2dc322a",
                "packagetype": "sdist",
                "python_version": "source",
                "requires_python": null,
                "size": 3074,
                "upload_time": "2016-09-14T03:49:20",
                "url": "https://files.pythonhosted.org/packages/8c/4b/752ce0ee3711dee1eea789082d0f33ad793cff438103376a652c8124a191/knapsack01-0.0.1.tar.gz"
            }
        ],
        "0.1": []
    },
    "urls": []
}