An Improved Heuristic for Multidimensional 0-1 Knapsack Problems
From MaRDI portal
Recommendations
- Improved convergent heuristics for the 0-1 multidimensional knapsack problem
- Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem
- Heuristics for the 0-1 multidimensional knapsack problem
- A heuristic algorithm for the multidimensional zero-one knapsack problem
- Improved results on the 0--1 multidimensional knapsack problem
- Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem
- scientific article; zbMATH DE number 1054949
- Problem reduction heuristic for the 0-1 multidimensional knapsack problem
- A heuristic solution procedure for the multiconstraint zero-one knapsack problem
- scientific article; zbMATH DE number 1728442
Cited in
(28)- An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem
- Heuristics for the 0-1 multidimensional knapsack problem
- A complementary greedy heuristic for the knapsack problem
- The multidimensional 0-1 knapsack problem: an overview.
- Problem reduction heuristic for the 0-1 multidimensional knapsack problem
- Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem
- A memetic Lagrangian heuristic for the 0-1 multidimensional knapsack problem
- A RNN-based hyper-heuristic for combinatorial problems
- Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem
- Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem
- A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem
- Greedy algorithm for the general multidimensional knapsack problem
- A local-search-based heuristic for the demand-constrained multidimensional knapsack problem
- A heuristic solution procedure for the multiconstraint zero-one knapsack problem
- Note—An Approximate Algorithm for Multidimensional Zero-One Knapsack Problems—A Parametric Approach
- scientific article; zbMATH DE number 1054949 (Why is no real title available?)
- A fuzzy genetic algorithm based on binary encoding for solving multidimensional knapsack problems
- Une approche hybride pour le sac à dos multidimensionnel en variables 0–1
- Essential particle swarm optimization queen with tabu search for MKP resolution
- scientific article; zbMATH DE number 7561569 (Why is no real title available?)
- Heuristics for the general multiple non-linear knapsack problem
- Partial enumeration in heuristics for some combinatorial optimization problems
- Improved convergent heuristics for the 0-1 multidimensional knapsack problem
- Replacement method for restrict of special multidimensional 0-1 knapsack problem-creative method of single restriction
- Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search
- An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual
- A new polynomial time algorithm for 0-1 multiple knapsack problem based on dominant principles
- Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem
This page was built for publication: An Improved Heuristic for Multidimensional 0-1 Knapsack Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5202507)
