Simple but efficient approaches for the collapsing knapsack problem

DOI10.1016/S0166-218X(96)00134-5zbMATH Open0881.90098DBLPjournals/dam/PferschyPW97OpenAlexW2082718338WikidataQ58826516 ScholiaQ58826516MaRDI QIDQ1364474FDOQ1364474

Authors: Ulrich Pferschy, David Pisinger, Gerhard J. Woeginger 

Publication date: 4 September 1997

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

Recommendations

• An efficient algorithm for the collapsing knapsack problem
• scientific article; zbMATH DE number 1973871
• An exact algorithm for the 0-1 collapsing knapsack problem
• A SHORT NOTE ON THE REDUCIBILITY OF THE COLLAPSING KNAPSACK PROBLEM
• A new exact approach for the 0-1 collapsing knapsack problem
• A dual approach for the continuous collapsing knapsack problem
• Exact methods for the knapsack problem and its generalizations
• A new approximate algorithm for the knapsack problem
• A new approximation algorithm for the knapsack problem
• Approximation algorithms for the weight-reducible knapsack problem

zbMATH Keywords

collapsing knapsack problempseudo-polynomial solution times

Mathematics Subject Classification ID

Boolean programming (90C09)

Cites Work

• An Algorithm for Large Zero-One Knapsack Problems
• A minimal algorithm for the multiple-choice knapsack problem
• A New Algorithm for the 0-1 Knapsack Problem
• An exact algorithm for the 0-1 collapsing knapsack problem
• The Collapsing 0–1 Knapsack Problem

Cited In (12)

• An efficient algorithm for the collapsing knapsack problem
• Integer knapsack problems with set-up weights
• A dual approach for the continuous collapsing knapsack problem
• A fast algorithm for strongly correlated knapsack problems
• Revisiting \textit{Where are the hard knapsack problems?} via instance space analysis
• A SHORT NOTE ON THE REDUCIBILITY OF THE COLLAPSING KNAPSACK PROBLEM
• Exact solution of a class of nonlinear knapsack problems
• Approximation algorithms for knapsack problems with cardinality constraints
• A heuristic approach for allocation of data to RFID tags: a data allocation knapsack problem (DAKP)
• An exact algorithm for the 0-1 collapsing knapsack problem
• Title not available (Why is that?)
• A new exact approach for the 0-1 collapsing knapsack problem

Uses Software

• Knapsack

This page was built for publication: Simple but efficient approaches for the collapsing knapsack problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1364474)