A well-solvable special case of the bounded knapsack problem (Q2275577): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4142699 / 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 | |||
| Property / cites work | |||
| Property / cites work: A polynomial-time algorithm for knapsack with divisible item sizes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A polynomially solvable special case of the unbounded knapsack problem / rank | |||
Normal rank | |||
Latest revision as of 09:47, 4 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A well-solvable special case of the bounded knapsack problem |
scientific article |
Statements
A well-solvable special case of the bounded knapsack problem (English)
0 references
9 August 2011
0 references
combinatorial optimization
0 references
computational complexity
0 references
polynomial time algorithm
0 references
cross ratio ordered
0 references
0 references
