Dynamic-Programming-Based Inequalities for the Unbounded Integer Knapsack Problem
Autor: | Panos M. Pardalos, Joseph C. Hartman, Xueqi He |
---|---|
Rok vydání: | 2016 |
Předmět: |
Discrete mathematics
Mathematical optimization 021103 operations research Computer science Applied Mathematics Continuous knapsack problem 0211 other engineering and technologies 0102 computer and information sciences 02 engineering and technology 01 natural sciences Dynamic programming 010201 computation theory & mathematics Cutting stock problem Knapsack problem Change-making problem Integer programming Generalized assignment problem Information Systems Integer (computer science) |
Zdroj: | Informatica. 27:433-450 |
ISSN: | 1822-8844 0868-4952 |
Databáze: | OpenAIRE |
Externí odkaz: |