scientific article; zbMATH DE number 1054949
From MaRDI portal
Publication:4350066
Recommendations
- Heuristics for the 0-1 multidimensional knapsack problem
- Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem
- An Improved Heuristic for Multidimensional 0-1 Knapsack Problems
- Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem
- A procedure-based heuristic for 0-1 multiple knapsack problems
Cited in
(15)- An Improved Heuristic for Multidimensional 0-1 Knapsack Problems
- A new polynomial time algorithm for 0-1 multiple knapsack problem based on dominant principles
- An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem
- A randomized heuristic repair for the multidimensional knapsack problem
- The noising methods: A generalization of some metaheuristics
- The multidimensional 0-1 knapsack problem: an overview.
- Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem
- An efficient tabu search approach for the 0-1 multidimensional knapsack problem
- Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem
- Improved convergent heuristics for the 0-1 multidimensional knapsack problem
- A procedure-based heuristic for 0-1 multiple knapsack problems
- Heuristics for the 0-1 multidimensional knapsack problem
- Improved results on the 0--1 multidimensional knapsack problem
- AN APPROACH FOR WORST CASE ANALYSIS OF HEURISTICS : ANALYSIS OF A FLEXIBLE 0-1 KNAPSACK PROBLEM
- Extension of reverse elimination method through a dynamic management of the tabu list
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4350066)
