A randomized heuristic repair for the multidimensional knapsack problem
From MaRDI portal
Recommendations
- Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem
- A ``reduce and solve approach for the multiple-choice multidimensional knapsack problem
- Heuristics for the 0-1 multidimensional knapsack problem
- The multidimensional knapsack problem: structure and algorithms
- scientific article; zbMATH DE number 1054949
Cites work
- scientific article; zbMATH DE number 1703851 (Why is no real title available?)
- scientific article; zbMATH DE number 12464 (Why is no real title available?)
- A genetic algorithm for the multidimensional knapsack problem
- A new ant colony optimization algorithm for the multidimensional Knapsack problem
- A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem
- CORAL: an exact algorithm for the multidimensional knapsack problem
- Particle swarm optimization with time-varying acceleration coefficients for the multidimensional knapsack problem
- The multidimensional 0-1 knapsack problem: an overview.
- The multidimensional knapsack problem: structure and algorithms
- There is no EPTAS for two-dimensional knapsack
Cited in
(2)
This page was built for publication: A randomized heuristic repair for the multidimensional knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q828650)