The Multiple-Choice Nested Knapsack Model
From MaRDI portal
Publication:3956742
DOI10.1287/mnsc.28.1.34zbMath0493.90061OpenAlexW2001473246MaRDI QIDQ3956742
Prabhakant Sinha, Andris A. Zoltners, Ronald D. Armstrong
Publication date: 1982
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.28.1.34
algorithmmarketingcomputational testingmultiple-choice nested knapsack modelmultiple-choice variables setsnested resource constraintsspecially-structured integer programming
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Boolean programming (90C09) Operations research and management science (90B99)
Related Items (7)
Exact methods for the knapsack problem and its generalizations ⋮ Solving the linear multiple choice knapsack problem with two objectives: Profit and equity ⋮ Bounds for nested knapsack problems ⋮ A dynamic programming approach to the multiple-choice multi-period knapsack problem and the recursive APL2 code ⋮ An efficient algorithm for the Lagrangean dual of nonlinear knapsack problems with additional nested constraints ⋮ An algorithm for a separable integer programming problem with cumulatively bounded variables ⋮ On an optimization problem with nested constraints
This page was built for publication: The Multiple-Choice Nested Knapsack Model
