A Note on Approximation Schemes for Multidimensional Knapsack Problems
From MaRDI portal
Publication:3718485
DOI10.1287/moor.9.2.244zbMath0589.90059OpenAlexW1984121220WikidataQ59664992 ScholiaQ59664992MaRDI QIDQ3718485
Maw-Sheng Chern, Michael J. Magazine
Publication date: 1984
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.9.2.244
Related Items
An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem, Approximating multidimensional subset sum and Minkowski decomposition of polygons, Shrinking maxima, decreasing costs: new online packing and covering problems, An improved binary search algorithm for the Multiple-Choice Knapsack Problem, Approximation schemes for packing problems with \(\ell_p\)-norm diversity constraints, Blessing of massive scale: spatial graphical model estimation with a total cardinality constraint approach, Vanishing Price of Decentralization in Large Coordinative Nonconvex Optimization, Vector bin packing with multiple-choice, A solution procedure for general knapsack problems with a few constraints, Capacity allocation problem with random demands for the rail container carrier, The multidimensional 0-1 knapsack problem: an overview., A PTAS for the square tiling problem, Distributed approximation of \(k\)-service assignment, On the computational complexity of reliability redundancy allocation in a series system, Budgeted matching and budgeted matroid intersection via the gasoline puzzle, Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search, A faster FPTAS for knapsack problem with cardinality constraint, There is no EPTAS for two-dimensional knapsack, A faster FPTAS for knapsack problem with cardinality constraint, The multidimensional 0-1 knapsack problem -- bounds and computational aspects
