Note—An Approximate Algorithm for Multidimensional Zero-One Knapsack Problems—A Parametric Approach
From MaRDI portal
Recommendations
- An Improved Heuristic for Multidimensional 0-1 Knapsack Problems
- A heuristic solution procedure for the multiconstraint zero-one knapsack problem
- Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
- Heuristics for the 0-1 multidimensional knapsack problem
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
Cited in
(13)- A multi-KP modeling for the maximum-clique problem
- Decentralization of responsibility for site decontamination projects: A budget allocation approach
- The multidimensional 0-1 knapsack problem: an overview.
- An efficient tabu search approach for the 0-1 multidimensional knapsack problem
- An approximate algorithm for lexicographic search in multiple orders for the solution of the multidimensional Boolean knapsack problem
- An approximate dynamic programming approach to multidimensional knapsack problems
- The effects of coefficient correlation structure in two-dimensional knapsack problems on solution procedure performance
- Measuring the Quality of Approximate Solutions to Zero-One Programming Problems
- Asignacion de recuerdos max-min: Propiedades y algoritmos
- A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem
- Une approche hybride pour le sac à dos multidimensionnel en variables 0–1
- A \(K\)-means supported reinforcement learning framework to multi-dimensional knapsack
- Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
This page was built for publication: Note—An Approximate Algorithm for Multidimensional Zero-One Knapsack Problems—A Parametric Approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3780001)
