Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMaría Merino 0001
Person information
- affiliation: University of the Basque Country (UPV/EHU), Department of Applied Mathematics and Statistics and Operations Research, Leioa, Spain
Other persons with the same name
- María Merino 0002 — National Institutes of Health, National Cancer Institute, Bethesda, MD, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j16]Gorka Kobeaga
, Jairo Rojas-Delgado, María Merino, José Antonio Lozano:
A revisited branch-and-cut algorithm for large-scale orienteering problems. Eur. J. Oper. Res. 313(1): 44-68 (2024)- 2022
- [j15]Imanol Unanue, María Merino, José Antonio Lozano:
A mathematical analysis of EDAs with distance-based exponential models. Memetic Comput. 14(3): 305-334 (2022) - 2021
- [j14]Gorka Kobeaga, María Merino, José Antonio Lozano:
On solving cycle problems with Branch-and-Cut: extending shrinking and exact subcycle elimination separation algorithms. Ann. Oper. Res. 305(1): 107-136 (2021) - 2019
- [j13]Unai Aldasoro, María Merino, Gloria Pérez:
Time consistent expected mean-variance in multistage stochastic quadratic optimization: a model and a matheuristic. Ann. Oper. Res. 280(1-2): 151-187 (2019) - [j12]José Domingo Villarroel, María Merino, Álvaro Antón:
Symmetrical Motifs in Young Children's Drawings: A Study on Their Representations of Plant Life. Symmetry 11(1): 26 (2019) - 2018
- [j11]Gorka Kobeaga, María Merino, José Antonio Lozano:
An efficient evolutionary algorithm for the orienteering problem. Comput. Oper. Res. 90: 42-59 (2018) - 2017
- [j10]Unai Aldasoro, Laureano F. Escudero, María Merino, Gloria Pérez:
A parallel Branch-and-Fix Coordination based matheuristic algorithm for solving large sized multistage stochastic mixed 0-1 problems. Eur. J. Oper. Res. 258(2): 590-606 (2017) - 2016
- [j9]Laureano F. Escudero, María Araceli Garín, María Merino, Gloria Pérez:
On time stochastic dominance induced by mixed integer-linear recourse in multistage stochastic programs. Eur. J. Oper. Res. 249(1): 164-176 (2016) - 2013
- [j8]Unai Aldasoro, Laureano F. Escudero, María Merino, Gloria Pérez:
An algorithmic framework for solving large-scale multistage stochastic mixed 0-1 problems with nonsymmetric scenario trees. Part II: Parallelization. Comput. Oper. Res. 40(12): 2950-2960 (2013) - 2012
- [j7]Laureano F. Escudero, María Araceli Garín, María Merino, Gloria Pérez:
An algorithmic framework for solving large-scale multistage stochastic mixed 0-1 problems with nonsymmetric scenario trees. Comput. Oper. Res. 39(5): 1133-1144 (2012) - [j6]Laureano F. Escudero, María Araceli Garín, María Merino, Gloria Pérez:
An algorithmic framework for solving large scale multistage stochastic mixed 0-1 problems with nonsymmetric scenario trees. Comput. Oper. Res. 39(9): 2266 (2012) - 2010
- [j5]Laureano F. Escudero, María Araceli Garín, María Merino, Gloria Pérez:
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. 37(4): 738-753 (2010) - [j4]Laureano F. Escudero, María Araceli Garín, María Merino, Gloria Pérez:
An exact algorithm for solving large-scale two-stage stochastic mixed-integer problems: Some theoretical and experimental aspects. Eur. J. Oper. Res. 204(1): 105-116 (2010) - 2009
- [j3]Laureano F. Escudero, María Araceli Garín, María Merino, Gloria Pérez:
On multistage Stochastic Integer Programming for incorporating logical constraints in asset and liability management under uncertainty. Comput. Manag. Sci. 6(3): 307-327 (2009) - [j2]Laureano F. Escudero, María Araceli Garín, María Merino, Gloria Pérez:
A general algorithm for solving two-stage stochastic mixed 0-1 first-stage problems. Comput. Oper. Res. 36(9): 2590-2600 (2009) - 2007
- [j1]Laureano F. Escudero, María Araceli Garín, María Merino, Gloria Pérez:
A two-stage stochastic integer programming approach as a mixture of Branch-and-Fix Coordination and Benders Decomposition schemes. Ann. Oper. Res. 152(1): 395-420 (2007)
Conference and Workshop Papers
- 2023
- [c4]Imanol Unanue, María Merino, José Antonio Lozano:
The Natural Bias of Artificial Instances. CEC 2023: 1-8 - 2021
- [c3]Imanol Unanue, María Merino, José Antonio Lozano:
A General Framework Based on Walsh Decomposition for Combinatorial Optimization Problems. CEC 2021: 391-398 - 2019
- [c2]Imanol Unanue, María Merino, José Antonio Lozano:
A mathematical analysis of EDAs with distance-based exponential models. GECCO (Companion) 2019: 429-430 - 2011
- [c1]Laureano F. Escudero, María Araceli Garín, María Merino, Gloria Pérez:
On solving strong multistage nonsymmetric stochastic mixed 0-1 problems. OR 2011: 509-514
Informal and Other Publications
- 2020
- [i2]Gorka Kobeaga, María Merino, José Antonio Lozano:
On Solving Cycle Problems with Branch-and-Cut: Extending Shrinking and Exact Subcycle Elimination Separation Algorithms. CoRR abs/2004.14574 (2020) - [i1]Gorka Kobeaga, María Merino, José Antonio Lozano:
A revisited branch-and-cut algorithm for large-scale orienteering problems. CoRR abs/2011.02743 (2020)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 01:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
