View

Resource metadata

Title	Test instances for a binary knapsack problem
Persons	Authors: Jarosław Pempera Partner: Wrocław University of Science and Technology
Description	Test instances was generated based on OR-library instances. For each instance we consider only one constraint (the first one). The format of the data files is as follows: Number of items (n), kanpsack capacity (B); For each item i (i=1,...,n): size of the item; For each item i (i=1,...,n): profit of the item. (English)
Keywords	"scheduling"@en, "binary knapsack problem"@en, "instance"@en
Classification	Resource type: dataset, database Scientific discipline: Dziedzina nauk inżynieryjno-technicznych / informatyka techniczna i telekomunikacja (2018) Destination group: scientists Harmful content: No
Characteristics	Place of creation: Wrocław Creation time: 2023 Resource language: English
License	CC BY-SA 4.0
Technical information	Submitter: Mariusz Uchroński Availability date: 24-04-2023
Collections	Kolekcja Politechniki Wrocławskiej

Citation

Copied

Jarosław Pempera. Test instances for a binary knapsack problem. [dataset, database] Available in Atlas of Open Science Resources, . License: CC BY-SA 4.0, https://creativecommons.org/licenses/by-sa/4.0/legalcode.pl. Date of access: DD.MM.RRRR.

Similar resources

Test instances for a Time-Dependent Traveling Salesman Problem

Mariusz Uchroński, Jarosław Pempera, dataset, database, Wrocław University of Science and Technology, Dziedzina nauk inżynieryjno-technicznych / automatyka, elektronika i elektrotechnika (2018)

Benchmarks for the cyclic flow-shop scheduling with no-wait constraints and missing operations

Jarosław Pempera, Czesław Smutnicki, dataset, database, Wrocław University of Science and Technology, Dziedzina nauk inżynieryjno-technicznych / automatyka, elektronika i elektrotechnika (2018)

Test instances for a single-machine total weighted tardiness scheduling problem

Mariusz Uchroński, dataset, database, Wrocław University of Science and Technology, Dziedzina nauk inżynieryjno-technicznych / automatyka, elektronika i elektrotechnika (2018)

Probabilistic properties of threshold ang greedy algorithms for the binary knapsack problem (PN-1986-03)

Marek Libura, Krzysztof Szkatuła, article, chapter, Systems Research Institute Polish Academy of Sciences, Warsaw, Dziedzina nauk ścisłych i przyrodniczych / informatyka (2018)

On probabilistic properties of greedy-like algorithms for the binary knapsack problem (PN-1987-13)

Marek Libura, Krzysztof Szkatuła, article, chapter, Systems Research Institute Polish Academy of Sciences, Warsaw, Dziedzina nauk ścisłych i przyrodniczych / informatyka (2018)