A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support (Q403644): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C11 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C15 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6336103 / 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
 
chance constraints
Property / zbMATH Keywords: chance constraints / rank
 
Normal rank
Property / zbMATH Keywords
 
probabilistic constraints
Property / zbMATH Keywords: probabilistic constraints / rank
 
Normal rank
Property / zbMATH Keywords
 
decomposition
Property / zbMATH Keywords: decomposition / rank
 
Normal rank

Revision as of 16:56, 29 June 2023

scientific article
Language Label Description Also known as
English
A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support
scientific article

    Statements

    A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support (English)
    0 references
    0 references
    29 August 2014
    0 references
    stochastic programming
    0 references
    integer programming
    0 references
    chance constraints
    0 references
    probabilistic constraints
    0 references
    decomposition
    0 references

    Identifiers