The multiple-choice multi-period knapsack problem

DOI10.1057/PALGRAVE.JORS.2601661MaRDI QIDQ4661132zbMATH OpenOpenAlexFDO

Authors ChungMin Wu, Edward Yu-Hsien Lin

Publication date 4 April 2005

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/palgrave.jors.2601661

zbMATH Keywords

integer programmingknapsack problemmultiple-choice programmingnon-convex programming

Mathematics Subject Classification ID

Integer programming (90C10) Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• scientific article; zbMATH DE number 3984973
• On the multiperiod binary knapsack problem
• scientific article; zbMATH DE number 3900493
• The knapsack problem with disjoint multiple-choice constraints
• The linear multiple choice knapsack problem
• A dynamic programming approach to solving the multiple choice knapsack problem
• scientific article; zbMATH DE number 3906236
• Multiple criteria dynamic programming and multiple knapsack problem
• scientific article; zbMATH DE number 3889280
• scientific article; zbMATH DE number 1728442

Cited in

(15)

• On the multiperiod binary knapsack problem
• A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem
• Approximation schemes for multiperiod binary knapsack problems
• Multistage knapsack
• A dynamic programming approach to the multiple-choice multi-period, knapsack problem and the recursive APL2 code
• MVRC Heuristic for Solving the Multi-Choice Multi-Constraint Knapsack Problem
• scientific article; zbMATH DE number 3900493 (Why is no real title available?)
• scientific article; zbMATH DE number 3906236 (Why is no real title available?)
• scientific article; zbMATH DE number 3984973 (Why is no real title available?)
• A multi-period renewal equipment problem
• The burglar problem with multiple options
• Multiple criteria dynamic programming and multiple knapsack problem
• Budgeting with bounded multiple-choice constraints.
• Solving the linear multiple choice knapsack problem with two objectives: Profit and equity
• The linking set problem: a polynomial special case of the multiple-choice knapsack problem

This page was built for publication: The multiple-choice multi-period knapsack problem

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