Simple but efficient approaches for the collapsing knapsack problem
type: Item
instance of: scholarly article
title: Simple but efficient approaches for the collapsing knapsack problem
zbMATH Open document ID: 0881.90098
DOI: 10.1016/S0166-218X(96)00134-5
author: Ulrich Pferschy
author: David Pisinger
author: Gerhard J. Woeginger
published in: Discrete Applied Mathematics
publication date: 1997-09-04T00:00:00Z
full work available at URL: dam
Mathematics Subject Classification ID: 90C09
zbMATH DE Number: 1057101
zbMATH Keywords: collapsing knapsack problem
zbMATH Keywords: pseudo-polynomial solution times
describes a project that uses: Knapsack
MaRDI profile type: Publication
Wikidata QID: Q58826516
cites work: An Algorithm for Large Zero-One Knapsack Problems
cites work: An exact algorithm for the 0-1 collapsing knapsack problem
cites work: A New Algorithm for the 0-1 Knapsack Problem
cites work: A minimal algorithm for the multiple-choice knapsack problem
cites work: The Collapsing 0–1 Knapsack Problem
OpenAlex ID: W2082718338
DBLP publication ID: journals/dam/PferschyPW97
Recommended article: An efficient algorithm for the collapsing knapsack problem
Recommended article: Q4421951
Recommended article: An exact algorithm for the 0-1 collapsing knapsack problem
Recommended article: A SHORT NOTE ON THE REDUCIBILITY OF THE COLLAPSING KNAPSACK PROBLEM
Recommended article: A new exact approach for the 0-1 collapsing knapsack problem
Recommended article: A dual approach for the continuous collapsing knapsack problem
Recommended article: Exact methods for the knapsack problem and its generalizations
Recommended article: Q3538766
Recommended article: Q5475207
Recommended article: Approximation Algorithms for the Weight-Reducible Knapsack Problem
description: scientific article; zbMATH DE number 1057101