A dynamic programming approach to the multiple-choice multi-period knapsack problem and the recursive APL2 code

DOI10.1080/02522667.2010.10699960zbMath1219.90143OpenAlexW2013555173MaRDI QIDQ3002339

No author found.

Publication date: 20 May 2011

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02522667.2010.10699960

zbMATH Keywords

dynamic programmingKnapsack problemAPL2 computing languagemultiple choice programming

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Dynamic programming (90C39)

Related Items (2)

A multi-period renewal equipment problem ⋮ Approximation schemes for multiperiod binary knapsack problems

Uses Software

• APL
• Knapsack
• APL2

Cites Work

• Unnamed Item
• Unnamed Item
• On a language for discrete dynamic programming and a microcomputer implementation
• Fast approximation algorithm for job sequencing with deadlines
• Dynamic programming: An interactive approach
• The APL phenomenon: An operational research perspective
• A minimal algorithm for the multiple-choice knapsack problem
• Generalized upper bounding techniques
• An Approximate Dynamic Programming Approach to Multidimensional Knapsack Problems
• The Linear Programming Approach to Approximate Dynamic Programming
• The Multiple-Choice Nested Knapsack Model
• The Multiple-Choice Knapsack Problem
• The multiple-choice multi-period knapsack problem
• Multiple choice programming: A state-of-the-art review

This page was built for publication: A dynamic programming approach to the multiple-choice multi-period knapsack problem and the recursive APL2 code