A branch-and-bound algorithm for hard multiple knapsack problems
type: Item
instance of: scholarly article
title: A branch-and-bound algorithm for hard multiple knapsack problems
zbMATH Open document ID: 1225.90104
author: Alex Fukunaga
published in: Annals of Operations Research
publication date: 2011-06-22T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 5911479
describes a project that uses: MULKNAP
describes a project that uses: Knapsack
MaRDI profile type: Publication
full work available at URL: s10479-009-0660-y
OpenAlex ID: W2024626675
cites work: A PTAS for the multiple subset sum problem with different knapsack capacities
cites work: A 3/4-approximation algorithm for multiple subset sum
cites work: Q4952619
cites work: The Loading Problem
cites work: Q4475624
cites work: Pruning moves
cites work: A new dominance procedure for combinatorial optimization problems
cites work: Q4475622
cites work: Q3624058
cites work: An algorithm for 0-1 multiple-knapsack problems
cites work: An Algorithm for the Solution of 0-1 Loading Problems
cites work: Computational aspects of clearing continuous call double auctions with assignment constraints and indivisible demand
cites work: Upper bounds and algorithms for the maximum cardinality bin packing problem.
cites work: A bound and bound algorithm for the zero-one multiple knapsack problem
cites work: Q3993418
cites work: An exact algorithm for large multiple knapsack problems
cites work: Where are the hard knapsack problems?
DOI: 10.1007/S10479-009-0660-Y
description: scientific article; zbMATH DE number 5911479