{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:00:59Z","timestamp":1725897659436},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642360619"},{"type":"electronic","value":"9783642360626"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36062-6_18","type":"book-chapter","created":{"date-parts":[[2013,2,19]],"date-time":"2013-02-19T12:39:20Z","timestamp":1361277560000},"page":"177-187","source":"Crossref","is-referenced-by-count":1,"title":["An Algorithm for Two-Stage Stochastic Quadratic Problems"],"prefix":"10.1007","author":[{"given":"Eugenio","family":"Mijangos","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1016\/S0377-2217(02)00628-8","volume":"151","author":"A. Alonso-Ayuso","year":"2003","unstructured":"Alonso-Ayuso, A., Escudero, L.F., Ortu\u00f1o, M.T.: BFC, a branch-and-fix coordination algorithm framework for solving some types of stochasticpure and mixed 0-1 programs. European Journal of Operational Research\u00a0151, 503\u2013519 (2003)","journal-title":"European Journal of Operational Research"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Corchero, C., Mijangos, E., Heredia, F.J.: A new optimal electricity market bid model solved through perspective cuts. Top (2012), doi:10.1007\/s11750-011-0240-6 (published online 2011)","DOI":"10.1007\/s11750-011-0240-6"},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"2590","DOI":"10.1016\/j.cor.2008.11.011","volume":"36","author":"L.F. Escudero","year":"2009","unstructured":"Escudero, L.F., Gar\u00edn, M., Merino, M., P\u00e9rez, G.: A general algorithm for solving two-stage stochastic mixed 0-1 first-stage problems. Computers & Operations Research\u00a036, 2590\u20132600 (2009)","journal-title":"Computers & Operations Research"},{"issue":"5","key":"18_CR4","doi-asserted-by":"publisher","first-page":"1133","DOI":"10.1016\/j.cor.2011.06.021","volume":"39","author":"L.F. Escudero","year":"2012","unstructured":"Escudero, L.F., Gar\u00edn, M., Merino, M., P\u00e9rez, G.: An algorithmic framework for solving large-scale multistage stochastic mixed 0-1 problems with nonsymmetric scenario trees. Computers & Operations Research\u00a039(5), 1133\u20131144 (2012)","journal-title":"Computers & Operations Research"},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s10107-005-0594-3","volume":"106","author":"A. Frangioni","year":"2006","unstructured":"Frangioni, A., Gentile, C.: Perspective cuts for a class of convex 0-1 mixed integer programs. Mathematical Programming\u00a0106, 225\u2013236 (2006)","journal-title":"Mathematical Programming"},{"key":"18_CR6","series-title":"IFIP AICT","first-page":"516","volume-title":"CSMO 2011","author":"F.J. Heredia","year":"2013","unstructured":"Heredia, F.J., Corchero, C., Mijangos, E.: Solving Electricity Market Quadratic Problems by Branch and Fix Coordination Methods. In: H\u00f6mberg, D., Tr\u00f6ltzsch, F. (eds.) CSMO 2011. IFIP AICT, vol.\u00a0391, pp. 516\u2013525. Springer, Heidelberg (2013)"},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1287\/opre.50.3.415.7751","volume":"50","author":"G. Laporte","year":"2002","unstructured":"Laporte, G., Louveaux, F.: An integer L-shaped algorithm for the capacited vehicle routing problem with stochastic demands. Operations Research\u00a050, 415\u2013423 (2002)","journal-title":"Operations Research"},{"key":"18_CR8","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/s10107-005-0592-5","volume":"105","author":"S. Sen","year":"2006","unstructured":"Sen, S., Sherali, H.: Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming. Mathematical Programming Series A\u00a0105, 203\u2013223 (2006)","journal-title":"Mathematical Programming Series A"},{"key":"18_CR9","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1023\/A:1013827731218","volume":"22","author":"H.D. Sherali","year":"2002","unstructured":"Sherali, H.D., Fraticelli, B.M.P.: A modification of Bender\u2019s decomposition algorithm for discrete subproblems: an approach for stochastic programs with integer recourse. Journal of Global Optimization\u00a022, 319\u2013342 (2002)","journal-title":"Journal of Global Optimization"},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1137\/0114008","volume":"14","author":"R.J.-B. Wets","year":"1966","unstructured":"Wets, R.J.-B.: Programming under uncertainty: the equivalent convex program. SIAM Journal on Applied Mathematics\u00a014, 89\u2013105 (1966)","journal-title":"SIAM Journal on Applied Mathematics"}],"container-title":["IFIP Advances in Information and Communication Technology","System Modeling and Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36062-6_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T04:54:51Z","timestamp":1557550491000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36062-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642360619","9783642360626"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36062-6_18","relation":{},"ISSN":["1868-4238","1861-2288"],"issn-type":[{"type":"print","value":"1868-4238"},{"type":"electronic","value":"1861-2288"}],"subject":[],"published":{"date-parts":[[2013]]}}}