Approximation for knapsack problems with multiple constraints

DOI10.1007/BF02948730zbMath0937.68152MaRDI QIDQ1964357

Yin Zhang, Li'ang Zhang

Publication date: 6 February 2000

Published in: Journal of Computer Science and Technology (Search for Journal in Brave)

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items (1)

Approximability of the two-stage stochastic knapsack problem with discretely distributed weights

Cites Work

• A fully polynomial approximation algorithm for the 0-1 knapsack problem
• Approximate algorithms for some generalized knapsack problems
• Approximation for multi-knapsack problem
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• Approximate Algorithms for the 0/1 Knapsack Problem
• `` Strong NP-Completeness Results
• Unnamed Item

This page was built for publication: Approximation for knapsack problems with multiple constraints