A general algorithm for solving two-stage stochastic mixed 0–1 first-stage problems

We present an algorithmic approach for solving large-scale two-stage stochastic problems having mixed 0–1 first stage variables. The constraints in the first stage of the deterministic equivalent model have 0–1 variables and continuous variables, while the constraints in the second stage have only c...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Computers & operations research Ročník 36; číslo 9; s. 2590 - 2600
Hlavní autoři:	Escudero, L.F., Garín, M.A., Merino, M., Pérez, G.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Kidlington Elsevier Ltd 01.09.2009 Elsevier Pergamon Press Inc
Témata:	Algorithms Applied sciences Benders decomposition Branch-and-fix coordination Exact sciences and technology Integer programming Mathematical programming Nonanticipativity constraints Operational research and scientific management Operational research. Management science Problem solving Splitting variables Stochastic models Studies Twin node family Two-stage stochastic integer programming Twin node family Two-stage stochastic integer programming Branch-and-fix coordination Splitting variables Benders decomposition Nonanticipativity constraints Script Partition method Algorithmics Cluster Linear programming Stochastic programming Integer programming Zero one programming Deterministic model Mixed problem Large scale
ISSN:	0305-0548, 1873-765X, 0305-0548
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!