María Merino

发表

The value of the stochastic solution in multistage problems

L. Escudero, A. Garín, María Merino, 2007 .

Time consistent expected mean-variance in multistage stochastic quadratic optimization: a model and a matheuristic

María Merino, G. Pérez, U. Aldasoro, 2018, Annals of Operations Research.

An algorithmic framework for solving large scale multistage stochastic mixed 0-1 problems with nonsymmetric scenario trees

María Merino, Gloria Pérez, Laureano F. Escudero, 2012, Comput. Oper. Res..

A parallel Branch-and-Fix Coordination based matheuristic algorithm for solving large sized multistage stochastic mixed 0-1 problems

Unai Aldasoro, María Merino, Gloria Pérez, 2017, Eur. J. Oper. Res..

On time stochastic dominance induced by mixed integer-linear recourse in multistage stochastic programs

Laureano F. Escudero, María Araceli Garín, María Merino, 2016, Eur. J. Oper. Res..

On parallelization of a stochastic dynamic programming algorithm for solving large-scale mixed 0–1 problems under uncertainty

Unai Aldasoro, María Merino, Gloria Pérez, 2015, TOP.

An algorithmic framework for solving large-scale multistage stochastic mixed 0-1 problems with nonsymmetric scenario trees. Part II: Parallelization

Unai Aldasoro, María Merino, Gloria Pérez, 2013, Comput. Oper. Res..

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

María Merino, Gloria Pérez, Laureano F. Escudero, 2009, Comput. Oper. Res..

Time consistent expected mean-variance in multistage stochastic quadratic optimization: a model and a matheuristic

Unai Aldasoro, María Merino, Gloria Pérez, 2018, Ann. Oper. Res..

A mathematical analysis of EDAs with distance-based exponential models

María Merino, José Antonio Lozano, Imanol Unanue, 2019, Memetic Computing.

A two-stage stochastic integer programming approach as a mixture of Branch-and-Fix Coordination and Benders Decomposition schemes

María Merino, Gloria Pérez, Laureano F. Escudero, 2007, Ann. Oper. Res..

An efficient evolutionary algorithm for the orienteering problem

María Merino, José Antonio Lozano, Gorka Kobeaga, 2018, Comput. Oper. Res..

On solving cycle problems with Branch-and-Cut: extending shrinking and exact subcycle elimination separation algorithms pdf

Jose A. Lozano, Gorka Kobeaga, Mar'ia Merino, 2020, Annals of Operations Research.

On parallelization of a stochastic dynamic programming algorithm for solving large-scale mixed 0–1 problems under uncertainty

J. F. Monge, L. Escudero, María Merino, 2015, TOP.

On BFC-MSMIP strategies for scenario cluster partitioning, and twin node family branching selection and bounding for multistage stochastic mixed integer programming

María Merino, Gloria Pérez, Laureano F. Escudero, 2010, Comput. Oper. Res..

BFC-MSMIP: an exact branch-and-fix coordination approach for solving multistage stochastic mixed 0–1 problems

María Merino, Gloria Pérez, L. Escudero, 2009 .

Metadata of the article that will be visualized in Online First

L. Escudero, A. Garín, María Merino, 2007 .