Approximation for knapsack problems with multiple constraints (Q1964357): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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
links / mardi / namelinks / mardi / name
 

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