Approximation for knapsack problems with multiple constraints (Q1964357): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Approximate algorithms for some generalized knapsack problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A fully polynomial approximation algorithm for the 0-1 knapsack problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3050129 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Approximate Algorithms for the 0/1 Knapsack Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Approximation for multi-knapsack problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: `` Strong '' NP-Completeness Results / rank | |||
Normal rank |
Latest revision as of 12:50, 29 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Approximation for knapsack problems with multiple constraints |
scientific article |
Statements
Approximation for knapsack problems with multiple constraints (English)
0 references
6 February 2000
0 references