Approximation for multi-knapsack problem

MaRDI QIDQ1814715zbMATH OpenFDO

Authors Li'ang Zhang, Luyang Li, Xiong Huang

Publication date 25 May 1997

Published in Chinese Science Bulletin (Search for Journal in Brave)

zbMATH Keywords

pseudo-polynomial time algorithmpolynomial-time approximation algorithmmulti-knapsack problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Parallel algorithms in computer science (68W10)

Recommendations

• Approximation for knapsack problems with multiple constraints
• Publication:4941826
• A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
• Publication:4952619

Cited in

(17)

• A Note on Approximation Schemes for Multidimensional Knapsack Problems
• Packing groups of items into multiple knapsacks
• A fully polynomial approximation scheme for a knapsack problem with a minimum filling constraint (extended abstract)
• Packing groups of items into multiple knapsacks
• Approximation issues of fractional knapsack with penalties: a note
• Hardness of approximation for knapsack problems
• A successive approximation algorithm for the multiple knapsack problem
• Approximating the product knapsack problem
• Approximation algorithms for the multiple knapsack problem with assignment restrictions
• On the proximity of the optimal values of the multi-dimensional knapsack problem with and without the cardinality constraint
• The complexity of the 0/1 multi-knapsack problem
• scientific article; zbMATH DE number 1830735 (Why is no real title available?)
• Approximation for knapsack problems with multiple constraints
• A PTAS for the multiple subset sum problem with different knapsack capacities
• Approximation algorithms for the weight-reducible knapsack problem
• A Lexicographic 0.5-Approximation Algorithm for the Multiple Knapsack Problem
• A Fast Approximation Scheme for the Multiple Knapsack Problem

This page was built for publication: Approximation for multi-knapsack problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1814715)