• English
  • Deutsch
  • Log In
    Password Login
    Research Outputs
    Fundings & Projects
    Researchers
    Institutes
    Statistics
Repository logo
Fraunhofer-Gesellschaft
  1. Home
  2. Fraunhofer-Gesellschaft
  3. Artikel
  4. A note on £2p-completeness of a robust binary linear program with binary uncertainty set
 
  • Details
  • Full
Options
2020
Journal Article
Title

A note on £2p-completeness of a robust binary linear program with binary uncertainty set

Abstract
We show that the robust binary linear program with uncertain objective function and binary uncertainty set defined by linear constraints is £2p-complete. This result is then extended to the K-adaptability version of the problem, where one of K pre-calculated solutions can be chosen after the uncertain parameter is revealed.
Author(s)
Claus, M.
Simmoteit, M.
Journal
Operations research letters  
DOI
10.1016/j.orl.2020.07.006
Language
English
Fraunhofer-Institut für Algorithmen und Wissenschaftliches Rechnen SCAI  
  • Cookie settings
  • Imprint
  • Privacy policy
  • Api
  • Contact
© 2024