Dynamic programming based algorithms for the discounted \(\{0-1\}\) knapsack problem (Q428109): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(6 intermediate revisions by 6 users not shown) | |||
Property / author | |||
Property / author: José Rui Figueira / rank | |||
Property / author | |||
Property / author: José Rui Figueira / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 65K05 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C10 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C39 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 91B10 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6047702 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
discounted knapsack problem | |||
Property / zbMATH Keywords: discounted knapsack problem / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
dynamic programming | |||
Property / zbMATH Keywords: dynamic programming / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
problem partition | |||
Property / zbMATH Keywords: problem partition / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
core concept | |||
Property / zbMATH Keywords: core concept / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
integer programming | |||
Property / zbMATH Keywords: integer programming / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
numerical experiments | |||
Property / zbMATH Keywords: numerical experiments / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
algorithm | |||
Property / zbMATH Keywords: algorithm / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: Knapsack / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.amc.2011.12.068 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1965011664 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4821303 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Finite Renewal Algorithm for the Knapsack and Turnpike Models / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Infinite Horizon Optimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An Algorithm for Large Zero-One Knapsack Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Minimal Algorithm for the 0-1 Knapsack Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Where are the hard knapsack problems? / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3241581 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3885184 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Solving bicriteria 0--1 knapsack problems using a labeling algorithm. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4945108 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A fast algorithm for strongly correlated knapsack problems / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 09:24, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Dynamic programming based algorithms for the discounted \(\{0-1\}\) knapsack problem |
scientific article |
Statements
Dynamic programming based algorithms for the discounted \(\{0-1\}\) knapsack problem (English)
0 references
19 June 2012
0 references
discounted knapsack problem
0 references
dynamic programming
0 references
problem partition
0 references
core concept
0 references
integer programming
0 references
numerical experiments
0 references
algorithm
0 references
0 references