{"id":34915355,"url":"https://github.com/klb2/qmkpy-datasets","last_synced_at":"2026-05-25T07:41:07.645Z","repository":{"id":54564350,"uuid":"522480994","full_name":"klb2/qmkpy-datasets","owner":"klb2","description":"A collection of reference datasets for the quadratic multiple knapsack problem (QMKP) to be used with QMKPy","archived":false,"fork":false,"pushed_at":"2022-10-07T11:31:38.000Z","size":3353,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-12-27T22:19:18.075Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"gpl-3.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/klb2.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2022-08-08T09:17:59.000Z","updated_at":"2022-08-09T13:37:38.000Z","dependencies_parsed_at":"2023-01-19T17:45:10.860Z","dependency_job_id":null,"html_url":"https://github.com/klb2/qmkpy-datasets","commit_stats":null,"previous_names":[],"tags_count":1,"template":false,"template_full_name":null,"purl":"pkg:github/klb2/qmkpy-datasets","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/klb2%2Fqmkpy-datasets","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/klb2%2Fqmkpy-datasets/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/klb2%2Fqmkpy-datasets/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/klb2%2Fqmkpy-datasets/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/klb2","download_url":"https://codeload.github.com/klb2/qmkpy-datasets/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/klb2%2Fqmkpy-datasets/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":33465616,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-25T06:32:55.349Z","status":"ssl_error","status_checked_at":"2026-05-25T06:32:35.322Z","response_time":57,"last_error":"SSL_read: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2025-12-26T12:17:37.352Z","updated_at":"2026-05-25T07:41:07.640Z","avatar_url":"https://github.com/klb2.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# QMKPy Datasets\nThis repository contains a collection of reference datasets for the quadratic\nmultiple knapsack problem (QMKP).\nThey are intended to be used with the [QMKPy\nlibrary](https://github.com/klb2/qmkpy).\n\n## Installation and Usage\nIn order to install and use the datasets, you simply need to download (or\nclone) this repository.\nAdditionally, you need to have `qmkpy` installed, e.g., by using\n```bash\npip3 install qmkpy\n```\n\nThe datasets can then be loaded via the `qmkpy.io.load_problem` function.\nFor more details and examples, please refer to the [documentation of\nQMKPy](https://qmkpy.readthedocs.io/en/latest/datasets.html).\n\n\n## Available Datasets\nAll datasets can be found in the `datasets/` directory.\nThe currently available datasets are the following:\n\n- `billionnet`: This is a popular dataset created by Billionnet and Soutil. It\n  was originally created for the quadratic single knapsack problem[^1][^2].\n  The original problems can be found\n  [here](https://cedric.cnam.fr/~soutif/QKP/QKP.html). For the adaption to the\n  quadratic _multiple_ knapsack problem, all knapsacks are set to have the same\n  capacity which is equal to 80% of the sum of all item weights divided by the\n  number of knapsacks. This version of the dataset has already been used in\n  literature for the QMKP[^3][^4][^5][^6].\n\n\n## Examples\nSome example script are additionally provided in this repository.\nThey demonstrate how the datasets can easily be used with any solution\nalgorithm.\n\nIn order to run the examples, you need to install additional packages via\n```bash\npip3 install -r requirements.txt\n```\n\nThe following examples are provided:\n\n- `example.py`: Generic script to run through all problems in a dataset and\n  solve them with multiple algorithms.\n- `example_billionnet.py`: Example script to use the Billionnet dataset. It\n  demonstrates how the dataset can be filtered to only consider problems with a\n  certain density and/or number of items/knapsacks.\n\n\n\n## References\n\n[^1]: Alain Billionnet and Eric Soutif. \"Using a Mixed Integer Programming Tool\n\t  for Solving the 0-1 Quadratic Knapsack Problem\", INFORMS J. on Comput\n\t  vol. 16(2): 188-197, 2004.\n\n[^2]: Alain Billionnet and Eric Soutif. \"An exact method for the 0-1 Quadratic\n\t  Knapsack Problem based on Lagrangian Decomposition\", European J. of\n\t  Operational Research vol. 157(3): 565-575, 2004.\n\t\n[^3]: Amanda Hiley and Bryant A. Julstrom. \"The quadratic multiple knapsack\n\t  problem and three heuristic approaches to it\", Proceedings of the 8th\n\t  annual conference on Genetic and evolutionary computation (GECCO ‘06),\n\t  pp. 547–552, 2006.\n\n[^4]: Carlos García-Martínez, Francisco J. Rodriguez, and Manuel Lozano.\n\t  \"Tabu-enhanced iterated greedy algorithm: a case study in the quadratic\n\t  multiple knapsack problem.\" European Journal of Operational Research\n\t  232(3): 454-463, 2014.\n\n[^5]: Yuning Chen, Jin-Kao Hao, and Fred Glover. \"An evolutionary path\n\t  relinking approach for the quadratic multiple knapsack problem.\"\n\t  Knowledge-Based Systems 92, pp. 23-34, 2016.\n\n[^6]: Méziane Aïder, Oussama Gacem, and Mhand Hifi. \"Branch and solve\n\t  strategies-based algorithm for the quadratic multiple knapsack problem\",\n\t  Journal of the Operational Research Society, vol. 73, no. 3, pp. 540-557,\n\t  2022.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fklb2%2Fqmkpy-datasets","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fklb2%2Fqmkpy-datasets","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fklb2%2Fqmkpy-datasets/lists"}