A robust approach to the chance-constrained knapsack problem
type: Item
instance of: scholarly article
title: A robust approach to the chance-constrained knapsack problem
zbMATH Open document ID: 1210.90126
author: Olivier Klopfenstein
author: Dritan Nace
published in: Operations Research Letters
publication date: 2008-11-27T00:00:00Z
Mathematics Subject Classification ID: 90C09
Mathematics Subject Classification ID: 90C15
zbMATH DE Number: 5374664
zbMATH Keywords: robust optimization
zbMATH Keywords: knapsack problem
zbMATH Keywords: stochastic programming
MaRDI profile type: Publication
full work available at URL: j.orl.2008.03.006
OpenAlex ID: W2027111774
cites work: Strong formulations of robust mixed 0-1 programming
cites work: Robust solutions of linear programming problems contaminated with uncertain data
cites work: Robust optimization-methodology and applications
cites work: Robust discrete optimization and network flows
cites work: The Price of Robustness
cites work: Introduction to Stochastic Programming
cites work: Uncertain convex programs: randomized solutions and confidence levels
cites work: A Robust Optimization Perspective on Stochastic Programming
cites work: Q3840423
cites work: Q3993418
cites work: Q5201292
cites work: Convex Approximations of Chance Constrained Programs
cites work: A note on robust 0-1 optimization with uncertain cost coefficients
DOI: 10.1016/J.ORL.2008.03.006
description: scientific article; zbMATH DE number 5374664