María Merino

Orcid: 0000-0002-4947-2784

Affiliations:
  • University of the Basque Country (UPV/EHU), Department of Applied Mathematics and Statistics and Operations Research, Leioa, Spain


According to our database1, María Merino authored at least 22 papers between 2007 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A revisited branch-and-cut algorithm for large-scale orienteering problems.
Eur. J. Oper. Res., February, 2024

Characterization of rankings generated by pseudo-Boolean functions.
Swarm Evol. Comput., 2024

A stochastic programming model for ambulance (re)location-allocation under equitable coverage and multi-interval response time.
Expert Syst. Appl., 2024

Almost Orthogonal Arrays: Theory and Search Three Ways.
CoRR, 2024

2023
The Natural Bias of Artificial Instances.
Proceedings of the IEEE Congress on Evolutionary Computation, 2023

2022
A mathematical analysis of EDAs with distance-based exponential models.
Memetic Comput., 2022

2021
On solving cycle problems with Branch-and-Cut: extending shrinking and exact subcycle elimination separation algorithms.
Ann. Oper. Res., 2021

A General Framework Based on Walsh Decomposition for Combinatorial Optimization Problems.
Proceedings of the IEEE Congress on Evolutionary Computation, 2021

2020
A revisited branch-and-cut algorithm for large-scale orienteering problems.
CoRR, 2020

2019
Symmetrical Motifs in Young Children's Drawings: A Study on Their Representations of Plant Life.
Symmetry, 2019

Time consistent expected mean-variance in multistage stochastic quadratic optimization: a model and a matheuristic.
Ann. Oper. Res., 2019

2018
An efficient evolutionary algorithm for the orienteering problem.
Comput. Oper. Res., 2018

2017
A parallel Branch-and-Fix Coordination based matheuristic algorithm for solving large sized multistage stochastic mixed 0-1 problems.
Eur. J. Oper. Res., 2017

2016
On time stochastic dominance induced by mixed integer-linear recourse in multistage stochastic programs.
Eur. J. Oper. Res., 2016

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

2012
An algorithmic framework for solving large scale multistage stochastic mixed 0-1 problems with nonsymmetric scenario trees.
Comput. Oper. Res., 2012

2011
On solving strong multistage nonsymmetric stochastic mixed 0-1 problems.
Proceedings of the Operations Research Proceedings 2011, Selected Papers of the International Conference on Operations Research (OR 2011), August 30, 2011

2010
An exact algorithm for solving large-scale two-stage stochastic mixed-integer problems: Some theoretical and experimental aspects.
Eur. J. Oper. Res., 2010

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

2009
A general algorithm for solving two-stage stochastic mixed 0-1 first-stage problems.
Comput. Oper. Res., 2009

On multistage Stochastic Integer Programming for incorporating logical constraints in asset and liability management under uncertainty.
Comput. Manag. Sci., 2009

2007
A two-stage stochastic integer programming approach as a mixture of Branch-and-Fix Coordination and Benders Decomposition schemes.
Ann. Oper. Res., 2007


  Loading...