STOCHASTIC PROGRAMMING PROBLEM WITH FIXED CHARGE RECOURSE(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)

DOI10.15807/JORSJ.50.299MaRDI QIDQ5385035zbMATH OpenOpenAlexFDO

Authors Takayuki Shiina, Yu Tagaya, Susumu Morito

Publication date 29 April 2008

Published in Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL https://doi.org/10.15807/jorsj.50.299

zbMATH Keywords

stochastic optimizationbranch-and-cutgeneration planningstochastic programming with fixed charge recourse

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Stochastic programming (90C15)

Recommendations

• Solving stochastic programs with simple recourse
• Stochastic programming with simple integer recourse
• scientific article; zbMATH DE number 686898
• scientific article; zbMATH DE number 4089323
• Publication:3489789

This page was built for publication: STOCHASTIC PROGRAMMING PROBLEM WITH FIXED CHARGE RECOURSE(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5385035)