Solution of the zero-one multiple knapsack problem
type: Item
instance of: scholarly article
title: Solution of the zero-one multiple knapsack problem
zbMATH Open document ID: 0439.90059
DOI: 10.1016/0377-2217(80)90112-5
author: Silvano Martello
author: Paolo Toth
published in: European Journal of Operational Research
publication date: 1980-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C09
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 68Q60
zbMATH DE Number: 3687090
zbMATH Keywords: zero-one multiple knapsack problem
zbMATH Keywords: branch and bound scheme
zbMATH Keywords: different branching strategies
zbMATH Keywords: bounding procedures
zbMATH Keywords: computational performance
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: solution algorithm
MaRDI profile type: Publication
full work available at URL: 0377-2217(80)90112-5
OpenAlex ID: W2031376842
cites work: Merging and Sorting Applied to the Zero-One Knapsack Problem
cites work: Dynamic Loading and Unloading of Liquids into Tanks
cites work: Computing Partitions with Applications to the Knapsack Problem
cites work: An algorithm for 0-1 multiple-knapsack problems
cites work: An Algorithm for the Solution of 0-1 Loading Problems
cites work: An upper bound for the zero-one knapsack problem and a branch and bound algorithm
description: scientific article; zbMATH DE number 3687090