Old Web
English
Sign In
Acemap
>
Paper
>
Dynamic-Programming-Based Inequalities for the Unbounded Integer Knapsack Problem
Dynamic-Programming-Based Inequalities for the Unbounded Integer Knapsack Problem
2016
Xueqi He
Joseph C. Hartman
Panos M. Pardalos
Keywords:
Mathematical optimization
Continuous knapsack problem
Computer science
Knapsack problem
Change-making problem
Generalized assignment problem
Cutting stock problem
Discrete mathematics
Dynamic programming
Inequality
Integer
Correction
Source
Cite
Save
Machine Reading By IdeaReader
15
References
0
Citations
NaN
KQI
[]