Complexity and in-approximability of a selection problem in robust optimization (Q385465)

From MaRDI portal
Revision as of 20:50, 20 June 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Complexity and in-approximability of a selection problem in robust optimization
scientific article

    Statements

    title
    Complexity and in-approximability of a selection problem in robust optimization (English)
    0 references
    published in
    4OR
    0 references
    publication date
    2 December 2013
    0 references
     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q385465&oldid=447531"
      Powered by MediaWiki