Heuristics for the 0-1 multidimensional knapsack problem
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1054949
- Improved results on 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
Cites work
- scientific article; zbMATH DE number 3900494 (Why is no real title available?)
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 1054949 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- scientific article; zbMATH DE number 3410784 (Why is no real title available?)
- An approximate dynamic programming approach to multidimensional knapsack problems
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
- An exact search for the solution of the surrogate dual of the 0-1 bidimensional knapsack problem
- Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- Evolution and state-of-the-art in integer programming
- Load balancing methods and parallel dynamic programming algorithm using dominance technique applied to the 0-1 knapsack problem
- New trends in exact algorithms for the \(0-1\) knapsack problem
- Surrogate Constraints
- The multidimensional 0-1 knapsack problem: an overview.
Cited in
(41)- An Improved Heuristic for Multidimensional 0-1 Knapsack Problems
- Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm
- scientific article; zbMATH DE number 1728442 (Why is no real title available?)
- On The Strength Of Relaxations Of Multidimensional Knapsack Problems
- A complementary greedy heuristic for the knapsack problem
- A new polynomial time algorithm for 0-1 multiple knapsack problem based on dominant principles
- Solving large-scale multidimensional knapsack problems with a new binary harmony search algorithm
- An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem
- Replacement method for restrict of special multidimensional 0-1 knapsack problem-creative method of single restriction
- A randomized heuristic repair for the multidimensional knapsack problem
- Memory and learning in metaheuristics
- Heuristic algorithms for the general nonlinear separable knapsack problem
- Revisiting surrogate relaxation for the multidimensional knapsack problem
- Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem
- Solving knapsack problems on GPU
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- A hybrid algorithm for the unbounded knapsack problem
- A dynamic programming based reduction procedure for the multidimensional 0-1 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
- A heuristic algorithm for resource allocation/reallocation problem
- Greedy algorithm for the general multidimensional knapsack problem
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- Improved convergent heuristics for the 0-1 multidimensional knapsack problem
- A procedure-based heuristic for 0-1 multiple knapsack problems
- An approximate algorithm for lexicographic search in multiple orders for the solution of the multidimensional Boolean knapsack problem
- Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem
- Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem
- A heuristic solution procedure for the multiconstraint zero-one knapsack problem
- The restrict merger approach of a kind of multidimensional 0-1 knapsack problem
- Improved results on the 0--1 multidimensional knapsack problem
- Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems
- Note—An Approximate Algorithm for Multidimensional Zero-One Knapsack Problems—A Parametric Approach
- A surrogate relaxation based algorithm for a general quadratic multi- dimensional knapsack problem
- Heuristics and reduction methods for multiple constraints 0-1 linear programming problems
- AN APPROACH FOR WORST CASE ANALYSIS OF HEURISTICS : ANALYSIS OF A FLEXIBLE 0-1 KNAPSACK PROBLEM
- A \(K\)-means supported reinforcement learning framework to multi-dimensional knapsack
- An approximate dynamic programming approach to multidimensional knapsack problems
- A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem
- Heuristics for the general multiple non-linear knapsack problem
- A memetic Lagrangian heuristic for the 0-1 multidimensional knapsack problem
This page was built for publication: Heuristics for the 0-1 multidimensional knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1042198)
