The multiple-choice multi-period knapsack problem

DOI10.1057/palgrave.jors.2601661zbMath1095.90088OpenAlexW2088215237MaRDI QIDQ4661132

ChungMin Wu, Edward Yu-Hsien Lin

Publication date: 4 April 2005

Published in: 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 problemnon-convex programmingmultiple-choice programming

Mathematics Subject Classification ID

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

Related Items (4)

Solving the linear multiple choice knapsack problem with two objectives: Profit and equity ⋮ A multi-period renewal equipment problem ⋮ A dynamic programming approach to the multiple-choice multi-period knapsack problem and the recursive APL2 code ⋮ Approximation schemes for multiperiod binary knapsack problems

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