The multi-band robust knapsack problem -- a dynamic programming approach
type: Item
instance of: scholarly article
title: The multi-band robust knapsack problem -- a dynamic programming approach
zbMATH Open document ID: 1387.90267
author: Grit Claßen
author: Anke Schmeink
author: Arie M. C. A. Koster
published in: Discrete Optimization
publication date: 2018-05-24T00:00:00Z
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 6872066
zbMATH Keywords: multi-band robustness
zbMATH Keywords: knapsack problem
zbMATH Keywords: dynamic program
describes a project that uses: CPLEX
describes a project that uses: Knapsack
MaRDI profile type: Publication
full work available at URL: j.disopt.2015.09.007
OpenAlex ID: W2161937787
cites work: Q3993418
cites work: Q4821303
cites work: A Minimal Algorithm for the 0-1 Knapsack Problem
cites work: The Price of Robustness
cites work: Q3182207
cites work: Theory and Applications of Robust Optimization
cites work: Cutting plane versus compact formulations for uncertain (integer) linear programs
cites work: A robust approach to the chance-constrained knapsack problem
cites work: Exact solution of the robust knapsack problem
cites work: Q4605945
cites work: Robust discrete optimization and network flows
cites work: A short note on the robust combinatorial optimization problems with cardinality constrained uncertainty
cites work: Strong formulations of robust mixed 0-1 programming
cites work: Where are the hard knapsack problems?
DOI: 10.1016/J.DISOPT.2015.09.007
description: scientific article; zbMATH DE number 6872066