A polynomial-time algorithm for knapsack with divisible item sizes (Q287072): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The cutting stock problem and integer rounding / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3993418 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation / rank | |||
Normal rank | |||
Revision as of 02:07, 12 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
