Testing integer knapsacks for feasibility
type: Item
instance of: scholarly article
title: Testing integer knapsacks for feasibility
zbMATH Open document ID: 0908.90192
DOI: 10.1016/0377-2217(94)00214-2
author: Paul Hansen
author: Jennifer K. Ryan
published in: European Journal of Operational Research
publication date: 1999-03-18T00:00:00Z
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 1208573
zbMATH Keywords: knapsack problems
zbMATH Keywords: group problem
zbMATH Keywords: feasibility testing
zbMATH Keywords: worst case time complexity
zbMATH Keywords: dynamic programming
MaRDI profile type: Publication
full work available at URL: 0377-2217(94)00214-2
OpenAlex ID: W2076444930
cites work: A New Knapsack Solution Approach by Integer Equivalent Aggregation and Consistency Determination
cites work: Q3241581
cites work: On a Problem of Partitions
cites work: Shortest-Route Methods: 2. Group Knapsacks, Expanded Networks, and Branch-and-Bound
cites work: Integer Programming over a Finite Additive Group
cites work: On the asymptotic integer algorithm
cites work: The structure of an integral monoid and integer programming feasibility
cites work: Dynamic Programming Algorithms for the Integer Programming Problem—I: The Integer Programming Problem Viewed as a Knapsack Type Problem
description: scientific article; zbMATH DE number 1208573