A dual approach for the continuous collapsing knapsack problem

DOI10.1007/BF02592953MaRDI QIDQ3778543zbMATH OpenFDO

Authors Marc E. Posner, Hisatoshi Suzuki

Publication date 1987

Published in Mathematical Programming (Search for Journal in Brave)

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

zbMATH Keywords

continuous collapsing knapsack problemdualitygeometric approachOptimality conditions

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Integer programming (90C10)

Recommendations

• Simple but efficient approaches for the collapsing knapsack problem
• An efficient algorithm for the collapsing knapsack problem
• scientific article; zbMATH DE number 4143769
• On the continuous quadratic knapsack problem
• A new exact approach for the 0-1 collapsing knapsack problem

Cites work

• A o(n logn) algorithm for LP knapsacks with GUB constraints
• An efficient algorithm for determining the convex hull of a finite planar set
• An exact algorithm for the 0-1 collapsing knapsack problem
• An O(n) algorithm for the linear multiple choice knapsack problem and related problems
• An O(n) algorithm for the multiple-choice knapsack linear program
• APPROXIMATE ALGORITHMS FOR THE MULTIPLE-CHOICE CONTINUOUS KNAPSACK PROBLEMS
• Convex hulls of finite sets of points in two and three dimensions
• Implicit representation of generalized variable upper bounds in linear programming
• The Collapsing 0–1 Knapsack Problem
• The continuous collapsing Knapsack problem
• The Linear Multiple Choice Knapsack Problem
• The Multiple-Choice Knapsack Problem
• THE MULTIPLE-CHOICE KNAPSACK PROBLEM

Cited in

(2)

• Simple but efficient approaches for the collapsing knapsack problem
• A SHORT NOTE ON THE REDUCIBILITY OF THE COLLAPSING KNAPSACK PROBLEM

This page was built for publication: A dual approach for the continuous collapsing knapsack problem

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