A comment on ``Computational complexity of stochastic programming problems'' (Q312699): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C15 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6627822 / rank
 
Normal rank
Property / zbMATH Keywords
 
stochastic programming
Property / zbMATH Keywords: stochastic programming / rank
 
Normal rank
Property / zbMATH Keywords
 
complexity theory
Property / zbMATH Keywords: complexity theory / rank
 
Normal rank
Property / zbMATH Keywords
 
two-stage problems
Property / zbMATH Keywords: two-stage problems / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2069737635 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Primer on Statistical Distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Stochastic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting linear extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of stochastic programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Computing the Volume of a Polyhedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On inverses of Vandermonde and confluent Vandermonde matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-Monte Carlo methods for linear two-stage stochastic programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4838490 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4830009 / rank
 
Normal rank
Property / cites work
 
Property / cites work: When are quasi-Monte Carlo algorithms efficient for high dimensional integrals? / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 14:50, 12 July 2024

scientific article
Language Label Description Also known as
English
A comment on ``Computational complexity of stochastic programming problems''
scientific article

    Statements

    A comment on ``Computational complexity of stochastic programming problems'' (English)
    0 references
    0 references
    0 references
    0 references
    16 September 2016
    0 references
    stochastic programming
    0 references
    complexity theory
    0 references
    two-stage problems
    0 references

    Identifiers