A polynomial-time algorithm for knapsack with divisible item sizes (Q287072): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / author | |||
| Property / author: Wim F. J. Verhaegh / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q25 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C27 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6585415 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
computational complexity | |||
| Property / zbMATH Keywords: computational complexity / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
combinatorial problems | |||
| Property / zbMATH Keywords: combinatorial problems / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
knapsack | |||
| Property / zbMATH Keywords: knapsack / rank | |||
Normal rank | |||
Revision as of 19:54, 27 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial-time algorithm for knapsack with divisible item sizes |
scientific article |
Statements
A polynomial-time algorithm for knapsack with divisible item sizes (English)
0 references
26 May 2016
0 references
computational complexity
0 references
combinatorial problems
0 references
knapsack
0 references
