A polynomial-time algorithm for knapsack with divisible item sizes (Q287072): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Emile H. L. Aarts / rank | |||
| Property / author | |||
| Property / author: Wim F. J. Verhaegh / rank | |||
| Property / author | |||
| Property / author: Emile H. L. Aarts / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:56, 5 March 2024
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
