A polynomial algorithm for the multiple knapsack problem with divisible item sizes
type: Item
instance of: scholarly article
title: A polynomial algorithm for the multiple knapsack problem with divisible item sizes
zbMATH Open document ID: 1209.68704
author: Paolo Detti
published in: Information Processing Letters
publication date: 2010-08-16T00:00:00Z
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 5771265
zbMATH Keywords: analysis of algorithms
zbMATH Keywords: multiple knapsack problem
zbMATH Keywords: divisible sizes
zbMATH Keywords: polynomial algorithms
MaRDI profile type: Publication
full work available at URL: j.ipl.2009.02.003
OpenAlex ID: W2051575470
cites work: Solving sequential knapsack problems
cites work: The cutting stock problem and integer rounding
cites work: The Sequential Knapsack Polytope
cites work: Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation
cites work: A polynomial-time algorithm for knapsack with divisible item sizes
DOI: 10.1016/J.IPL.2009.02.003
description: scientific article; zbMATH DE number 5771265