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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Nemhauser, George I. / rank
Normal rank
 
Property / author
 
Property / author: Nemhauser, George I. / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C59 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C60 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6055039 / rank
 
Normal rank
Property / zbMATH Keywords
 
stochastic programming
Property / zbMATH Keywords: stochastic programming / rank
 
Normal rank
Property / zbMATH Keywords
 
integer programming
Property / zbMATH Keywords: integer programming / rank
 
Normal rank
Property / zbMATH Keywords
 
submodular maximization
Property / zbMATH Keywords: submodular maximization / rank
 
Normal rank
Property / zbMATH Keywords
 
approximation algorithm
Property / zbMATH Keywords: approximation algorithm / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.orl.2011.11.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1979625029 / rank
 
Normal rank
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
links / mardi / namelinks / mardi / name
 

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