A collection of heuristic algorithms for solving the 2D knapsack problem,
also known as the bin packing problem. In essence packing a set of rectangles into the
smallest number of bins.
Raw data
{
"_id": null,
"home_page": "https://github.com/secnot/rectpack/",
"name": "rectpack",
"maintainer": "",
"docs_url": null,
"requires_python": "",
"maintainer_email": "",
"keywords": "knapsack,rectangle,packing 2D,bin,binpacking",
"author": "SecNot",
"author_email": "",
"download_url": "https://files.pythonhosted.org/packages/d6/72/b965bbfcfe5bcd486bbfc10a73345d51551971457ac2b84f786bfc6d86db/rectpack-0.2.2.tar.gz",
"platform": "",
"description": "A collection of heuristic algorithms for solving the 2D knapsack problem,\nalso known as the bin packing problem. In essence packing a set of rectangles into the\nsmallest number of bins.",
"bugtrack_url": null,
"license": "Apache-2.0",
"summary": "2D Rectangle packing library",
"version": "0.2.2",
"split_keywords": [
"knapsack",
"rectangle",
"packing 2d",
"bin",
"binpacking"
],
"urls": [
{
"comment_text": "",
"digests": {
"md5": "42a3710461a1000e4d902853fb4d1258",
"sha256": "15e383505fdfbaeb55ec640a5825d9ca2ce89019a6cdd552d6e57ec36c68ba2a"
},
"downloads": -1,
"filename": "rectpack-0.2.2.tar.gz",
"has_sig": false,
"md5_digest": "42a3710461a1000e4d902853fb4d1258",
"packagetype": "sdist",
"python_version": "source",
"requires_python": null,
"size": 17888,
"upload_time": "2021-11-24T21:12:56",
"upload_time_iso_8601": "2021-11-24T21:12:56.557776Z",
"url": "https://files.pythonhosted.org/packages/d6/72/b965bbfcfe5bcd486bbfc10a73345d51551971457ac2b84f786bfc6d86db/rectpack-0.2.2.tar.gz",
"yanked": false,
"yanked_reason": null
}
],
"upload_time": "2021-11-24 21:12:56",
"github": true,
"gitlab": false,
"bitbucket": false,
"github_user": "secnot",
"github_project": "rectpack",
"travis_ci": true,
"coveralls": false,
"github_actions": false,
"lcname": "rectpack"
}
JSON
