A heuristic algorithm for the multidimensional zero-one knapsack problem

DOI10.1016/0377-2217(84)90286-8zbMath0532.90070OpenAlexW2022338859MaRDI QIDQ789318

Osman Oguz, Michael J. Magazine

Publication date: 1984

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(84)90286-8

zbMATH Keywords

computational efficiencyheuristic algorithmcomparison of algorithmsmultidimensional zero-one knapsack problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Boolean programming (90C09)

Related Items

A simulated annealing approach to the multiconstraint zero-one knapsack problem, A RNN-based hyper-heuristic for combinatorial problems, Matheuristics: survey and synthesis, A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem, A fuzzy genetic algorithm based on binary encoding for solving multidimensional knapsack problems, A memetic Lagrangian heuristic for the 0-1 multidimensional knapsack problem, Modeling multiple plant sourcing decisions, The multidimensional 0-1 knapsack problem: an overview., Solving the Knapsack problem with imprecise weight coefficients using genetic algorithms, Essential particle swarm optimization queen with tabu search for MKP resolution, 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, Greedy algorithm for the general multidimensional knapsack problem, Analysis of maximum total return in the continuous knapsack problem with fuzzy object weights, Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method, Towards the real time solution of strike force asset allocation problems, Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search, Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls, Using fuzzy numbers in knapsack problems, Complexity indices for the multidimensional knapsack problem, Heuristic methods and applications: A categorized survey, The multidimensional 0-1 knapsack problem -- bounds and computational aspects

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Discrete Dynamic Programming and Capital Allocation
• Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
• Pivot and Complement–A Heuristic for 0-1 Programming
• An Algorithm for Large Zero-One Knapsack Problems
• A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems
• Heuristic 0-1 Linear Programming: An Experimental Comparison of Three Methods
• Solution of the Lorie-Savage and Similar Integer Programming Problems by the Generalized Lagrange Multiplier Method
• Letter to the Editor—A Note on the Generalized Lagrange Multiplier Solution to an Integer Programming Problem
• Efficient Heuristic Procedures for Integer Linear Programming with an Interior