Pages that link to "Item:Q3718485"
From MaRDI portal
The following pages link to A Note on Approximation Schemes for Multidimensional Knapsack Problems (Q3718485):
Displaying 29 items.
- Shrinking maxima, decreasing costs: new online packing and covering problems (Q289907) (← links)
- Vector bin packing with multiple-choice (Q427903) (← links)
- Capacity allocation problem with random demands for the rail container carrier (Q439359) (← links)
- A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (Q439503) (← links)
- A PTAS for the square tiling problem (Q476839) (← links)
- Budgeted matching and budgeted matroid intersection via the gasoline puzzle (Q543415) (← links)
- Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search (Q706997) (← links)
- There is no EPTAS for two-dimensional knapsack (Q765522) (← links)
- Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses (Q789319) (← links)
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
- A solution procedure for general knapsack problems with a few constraints (Q908852) (← links)
- On the computational complexity of reliability redundancy allocation in a series system (Q1196218) (← links)
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem (Q1327230) (← links)
- The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← links)
- Distributed approximation of \(k\)-service assignment (Q1733389) (← links)
- Approximation for knapsack problems with multiple constraints (Q1964357) (← links)
- An FPTAS for the \(\varDelta \)-modular multidimensional knapsack problem (Q2117618) (← links)
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
- The fractional multidimensional knapsack problem: solution and uniqueness (Q2157286) (← links)
- Hardness of approximation for knapsack problems (Q2345987) (← links)
- Approximating multidimensional subset sum and Minkowski decomposition of polygons (Q2364904) (← links)
- Blessing of massive scale: spatial graphical model estimation with a total cardinality constraint approach (Q2425168) (← links)
- (Q2722077) (← links)
- A Fast Approximation Scheme for the Multiple Knapsack Problem (Q2891378) (← links)
- An improved binary search algorithm for the Multiple-Choice Knapsack Problem (Q2954365) (← links)
- A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem (Q4289294) (← links)
- Vanishing Price of Decentralization in Large Coordinative Nonconvex Optimization (Q5359499) (← links)
- A faster FPTAS for knapsack problem with cardinality constraint (Q5918631) (← links)
- A faster FPTAS for knapsack problem with cardinality constraint (Q5970810) (← links)