A heuristic algorithm for the multidimensional zero-one knapsack problem
type: Item
instance of: scholarly article
title: A heuristic algorithm for the multidimensional zero-one knapsack problem
zbMATH Open document ID: 0532.90070
DOI: 10.1016/0377-2217(84)90286-8
author: Osman Oguz
author: Michael Magazine
published in: European Journal of Operational Research
publication date: 1984-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C09
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 3845346
zbMATH Keywords: heuristic algorithm
zbMATH Keywords: comparison of algorithms
zbMATH Keywords: multidimensional zero-one knapsack problem
zbMATH Keywords: computational efficiency
MaRDI profile type: Publication
full work available at URL: 0377-2217(84)90286-8
OpenAlex ID: W2022338859
cites work: Pivot and Complement–A Heuristic for 0-1 Programming
cites work: An Algorithm for Large Zero-One Knapsack Problems
cites work: Q3882189
cites work: Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
cites work: Q4124603
cites work: Q4198056
cites work: Q4178782
cites work: Efficient Heuristic Procedures for Integer Linear Programming with an Interior
cites work: Solution of the Lorie-Savage and Similar Integer Programming Problems by the Generalized Lagrange Multiplier Method
cites work: Letter to the Editor—A Note on the Generalized Lagrange Multiplier Solution to an Integer Programming Problem
cites work: Discrete Dynamic Programming and Capital Allocation
cites work: A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems
cites work: Q5574581
cites work: Heuristic 0-1 Linear Programming: An Experimental Comparison of Three Methods
description: scientific article; zbMATH DE number 3845346