An algorithm and efficient data structures for the binary knapsack problem
type: Item
instance of: scholarly article
title: An algorithm and efficient data structures for the binary knapsack problem
zbMATH Open document ID: 0402.90067
DOI: 10.1016/0377-2217(78)90137-6
published in: European Journal of Operational Research
publication date: 1978-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C09
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 3625116
zbMATH Keywords: Binary Knapsack Problem
zbMATH Keywords: Reduction Scheme
zbMATH Keywords: Branch and Bound Algorithm
zbMATH Keywords: Boolean Programming
zbMATH Keywords: Computational Study
author: Uwe H. Suhl
MaRDI profile type: Publication
full work available at URL: 0377-2217(78)90137-6
OpenAlex ID: W2061197582
cites work: Merging and Sorting Applied to the Zero-One Knapsack Problem
cites work: An Enumeration Algorithm for Knapsack Problems
cites work: Q3882189
cites work: Resolution of the 0–1 knapsack problem: Comparison of methods
cites work: Q4178782
cites work: Integer Programming Algorithms: A Framework and State-of-the-Art Survey
cites work: A Branch Search Algorithm for the Knapsack Problem
cites work: Mixed-integer Algorithms for the (0,1) Knapsack Problem
cites work: Q4062940
cites work: Computing Partitions with Applications to the Knapsack Problem
cites work: Reduction Algorithm for Zero-One Single Knapsack Problems
cites work: Q4142699
cites work: Q4082550
cites work: An Efficient Algorithm for the 0-1 Knapsack Problem
cites work: A branch and bound algorithm for the generalized assignment problem
cites work: Approximate Algorithms for the 0/1 Knapsack Problem
cites work: A Direct Descent Binary Knapsack Algorithm
description: scientific article; zbMATH DE number 3625116