scientific article; zbMATH DE number 4143769

MaRDI QIDQ3475124zbMATH OpenFDO

Authors Krzysztof Dudzinski

Publication date 1990

zbMATH Keywords

knapsack problemcontinuous relaxation0-1 collapsing knapsack

Mathematics Subject Classification ID

Linear programming (90C05) Analysis of algorithms and problem complexity (68Q25) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Recommendations

• On a cardinality constrained linear programming knapsack problem
• An exact algorithm for the 0-1 collapsing knapsack problem
• On equivalent knapsack problems
• scientific article; zbMATH DE number 3852791
• An O(n) algorithm for the linear multiple choice knapsack problem and related problems

Cited in

(8)

• An $0 (n^3)$ worst case bounded special $LP$ knapsack $(0-1)$ with two constraints
• A dual approach for the continuous collapsing knapsack problem
• An algorithm for solving a structured class of linear programming problems
• On a cardinality constrained linear programming knapsack problem
• scientific article; zbMATH DE number 4135714 (Why is no real title available?)
• scientific article; zbMATH DE number 3984973 (Why is no real title available?)
• Linear and integer programming made easy
• Linear programming selection of internal financial laws and a knapsack problem

This page was built for publication:

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