The continuous collapsing Knapsack problem

DOI10.1007/BF02591894MaRDI QIDQ3659529zbMATH OpenFDO

Authors Marc E. Posner

Publication date 1983

Published in Mathematical Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02591894

zbMATH Keywords

computational resultscontinuous collapsing knapsack problemreduction to two dimensional subproblemssubproblem elimination strategies

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Cites work

• An exact algorithm for the 0-1 collapsing knapsack problem
• scientific article; zbMATH DE number 3314878 (Why is no real title available?)
• The Collapsing 0–1 Knapsack Problem
• The decomposition of nonlinear problems

Cited in

(1)

• A dual approach for the continuous collapsing knapsack problem

This page was built for publication: The continuous collapsing Knapsack problem

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