New pseudopolynomial complexity bounds for the bounded and other integer knapsack related problems
type: Item
instance of: scholarly article
title: New pseudopolynomial complexity bounds for the bounded and other integer knapsack related problems
zbMATH Open document ID: 1173.90523
published in: Operations Research Letters
publication date: 2009-11-17T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 5634564
zbMATH Keywords: bounded knapsack problem
zbMATH Keywords: bounded multiple-choice knapsack problem
zbMATH Keywords: pseudopolynomial algorithms
zbMATH Keywords: multicover problem
author: Arie Tamir
describes a project that uses: Knapsack
MaRDI profile type: Publication
full work available at URL: j.orl.2009.05.003
OpenAlex ID: W1974761916
cites work: Heuristic algorithms for the multiple knapsack problem
cites work: Q4821303
cites work: Linear Time Algorithms for Knapsack Problems with Bounded Weights
cites work: The interval subset sum problem
cites work: Dynamic programming revisited: Improving knapsack algorithms
cites work: Cyclical scheduling and multi-shift scheduling: complexity and approximation algorithms
cites work: Sensitivity theorems in integer linear programming
cites work: Convex separable optimization is not much harder than linear optimization
cites work: The relationship between integer and real solutions of constrained convex programming
cites work: Budgeting with bounded multiple-choice constraints.
cites work: A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
cites work: An O(n) algorithm for the multiple-choice knapsack linear program
cites work: An O(n) algorithm for the linear multiple choice knapsack problem and related problems
cites work: Applying Parallel Computation Algorithms in the Design of Serial Algorithms
cites work: Slowing down sorting networks to obtain faster sorting algorithms
cites work: An Algorithm for Large Zero-One Knapsack Problems
DOI: 10.1016/J.ORL.2009.05.003
description: scientific article; zbMATH DE number 5634564