Sell or hold: A simple two-stage stochastic combinatorial optimization problem (Q435735): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Programming under Uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Two-Stage Stochastic Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: LP Rounding Approximation Algorithms for Stochastic Network Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: A factor \(\frac {1}{2}\) approximation algorithm for two-stage stochastic matching problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-monotone submodular maximization under matroid and knapsack constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hedging uncertainty: approximation algorithms for stochastic optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Stochastic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetry and Approximability of Submodular Maximization Problems / rank
 
Normal rank

Latest revision as of 11:41, 5 July 2024

scientific article
Language Label Description Also known as
English
Sell or hold: A simple two-stage stochastic combinatorial optimization problem
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references