BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0???1 programs, European Journal of Operational Research, vol.151, issue.3, pp.503-519, 2003. ,
DOI : 10.1016/S0377-2217(02)00628-8
A new optimal electricity market bid model solved through perspective cuts. TOP, published online, 2011. ,
A general algorithm for solving two-stage stochastic mixed 0???1 first-stage problems, Computers & Operations Research, vol.36, issue.9, pp.2590-2600, 2009. ,
DOI : 10.1016/j.cor.2008.11.011
An algorithmic framework for solving large-scale multistage stochastic mixed 0???1 problems with nonsymmetric scenario trees, Computers & Operations Research, vol.39, issue.5, pp.1133-1144, 2012. ,
DOI : 10.1016/j.cor.2011.06.021
Perspective cuts for a class of convex 0???1 mixed integer programs, Mathematical Programming, vol.22, issue.2, pp.225-236, 2006. ,
DOI : 10.1007/s10107-005-0594-3
A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes, Operations Research Letters, vol.37, issue.3, pp.206-210, 2009. ,
DOI : 10.1016/j.orl.2009.02.003
Options, futures and other derivatives, 2002. ,
An Algorithm for Two-Stage Stochastic Quadratic Problems, Proceedings of the 25th IFIP TC7 Conference, 2011. ,
DOI : 10.1007/978-3-642-36062-6_18
URL : https://hal.archives-ouvertes.fr/hal-01347535
Semidefinite relaxations of fractional programs via novel convexification techniques, Journal of Global Optimization, vol.20, pp.137-158, 2001. ,