A polynomial-time algorithm for knapsack with divisible item sizes (Q287072): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0020-0190(97)00061-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2030493804 / rank | |||
Normal rank | |||
Latest revision as of 10:45, 30 July 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
