liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Approximability of the two-stage stochastic knapsack problem with discretely distributed weights
Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, The Institute of Technology. (TCSLAB)
2014 (English)In: Discrete Applied Mathematics, ISSN 0166-218X, E-ISSN 1872-6771, Vol. 165, 192-204 p.Article in journal (Refereed) Published
Abstract [en]

In this paper the two-stage knapsack problem with random weights is studied under the aspect of approximability. We assume finite probability distributions for the weights and show that, unless P = NP, the so obtained problem cannot be approximated in polynomial time within a better ratio than K-1/2 (where K is the number of second-stage scenarios). We further study the special cases where in the second stage items can only be added or only be removed, but not both. Positive approximation results are given for three particular cases, namely linearly dependent first- and second-stage rewards, the polynomial scenario model and the case where the number of scenarios is assumed to be a constant. To the best of our knowledge, this is the first study of a two-stage knapsack problem under the aspect of approximability and the first time a non-approximability result has been proven for a stochastic knapsack problem of any kind.

Place, publisher, year, edition, pages
Elsevier , 2014. Vol. 165, 192-204 p.
Keyword [en]
Two-stage stochastic programming; Stochastic knapsack problem; Non-approximation; Approximation algorithms
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:liu:diva-106022DOI: 10.1016/j.dam.2013.02.015ISI: 000332354200018OAI: oai:DiVA.org:liu-106022DiVA: diva2:712943
Available from: 2014-04-17 Created: 2014-04-17 Last updated: 2017-12-13

Open Access in DiVA

No full text

Other links

Publisher's full text

Authority records BETA

Kosuch, Stefanie

Search in DiVA

By author/editor
Kosuch, Stefanie
By organisation
Software and SystemsThe Institute of Technology
In the same journal
Discrete Applied Mathematics
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 53 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf