A heuristic algorithm for the multidimensional zero-one knapsack problem
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3687091 (Why is no real title available?)
- scientific article; zbMATH DE number 3550465 (Why is no real title available?)
- scientific article; zbMATH DE number 3614502 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3291795 (Why is no real title available?)
- A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems
- An Algorithm for Large Zero-One Knapsack Problems
- Discrete dynamic programming and capital allocation
- Efficient Heuristic Procedures for Integer Linear Programming with an Interior
- Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
- Heuristic 0-1 Linear Programming: An Experimental Comparison of Three Methods
- Letter to the Editor—A Note on the Generalized Lagrange Multiplier Solution to an Integer Programming Problem
- Pivot and Complement–A Heuristic for 0-1 Programming
- Solution of the Lorie-Savage and Similar Integer Programming Problems by the Generalized Lagrange Multiplier Method
Cited in
(30)- An Improved Heuristic for Multidimensional 0-1 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
- Complexity indices for the multidimensional knapsack problem
- A RNN-based hyper-heuristic for combinatorial problems
- The multidimensional 0-1 knapsack problem: an overview.
- Modeling multiple plant sourcing decisions
- A simulated annealing approach to the multiconstraint zero-one knapsack problem
- Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem
- Solving the Knapsack problem with imprecise weight coefficients using genetic algorithms
- A fuzzy genetic algorithm based on binary encoding for solving multidimensional knapsack problems
- 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
- Une approche hybride pour le sac à dos multidimensionnel en variables 0–1
- Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method
- Matheuristics: survey and synthesis
- A heuristic solution procedure for the multiconstraint zero-one knapsack problem
- Using fuzzy numbers in knapsack problems
- Analysis of maximum total return in the continuous knapsack problem with fuzzy object weights
- Towards the real time solution of strike force asset allocation problems
- A local-search-based heuristic for the demand-constrained multidimensional knapsack problem
- Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls
- A \(K\)-means supported reinforcement learning framework to multi-dimensional knapsack
- Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search
- A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem
- Essential particle swarm optimization queen with tabu search for MKP resolution
- Heuristics for the general multiple non-linear knapsack problem
- A memetic Lagrangian heuristic for the 0-1 multidimensional knapsack problem
- Heuristic methods and applications: A categorized survey
This page was built for publication: A heuristic algorithm for the multidimensional zero-one knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q789318)
