default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMercedes Pelegrín-García
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j13]Mercedes Pelegrín:
New variants of the simple plant location problem and applications. Eur. J. Oper. Res. 306(3): 1094-1108 (2023)- [j12]Mercedes Pelegrín, Martina Cerulli
:
Aircraft Conflict Resolution: A Benchmark Generator. INFORMS J. Comput. 35(2): 274-285 (2023) - [j11]Mercedes Pelegrín, Claudia D'Ambrosio, Rémi Delmas, Youssef Hamadi:
Urban air mobility: from complex tactical conflict resolution to network design and fairness insights. Optim. Methods Softw. 38(6): 1311-1343 (2023) - 2022
- [j10]Mercedes Pelegrín, Claudia D'Ambrosio:
Aircraft Deconfliction via Mathematical Programming: Review and Insights. Transp. Sci. 56(1): 118-140 (2022) - [i1]Mercedes Pelegrín, Liding Xu:
Continuous Covering on Networks: Strong Mixed Integer Programming Formulations. CoRR abs/2203.00284 (2022) - 2021
- [j9]Alfredo Marín, Mercedes Pelegrín:
The double-assignment plant location problem with co-location. Comput. Oper. Res. 126: 105059 (2021) - [j8]Martine Labbé, Alfredo Marín, Mercedes Pelegrín:
Finding the root graph through minimum edge deletion. Eur. J. Oper. Res. 289(1): 59-74 (2021) - [j7]Martina Cerulli, Claudia D'Ambrosio, Leo Liberti, Mercedes Pelegrín:
Detecting and solving aircraft conflicts using bilevel programming. J. Glob. Optim. 81(2): 529-557 (2021) - 2020
- [j6]Emilio Carrizosa, Alfredo Marín, Mercedes Pelegrín:
Spotting Key Members in Networks: Clustering-Embedded Eigenvector Centrality. IEEE Syst. J. 14(3): 3916-3925 (2020)
2010 – 2019
- 2019
- [j5]Emilio Muñoz-Velasco, Mercedes Pelegrín-García, Pietro Sala, Guido Sciavicco, Ionel Eduard Stan:
On coarser interval temporal logics. Artif. Intell. 266: 1-26 (2019) - [j4]Alfredo Marín, Mercedes Pelegrín-García:
Adding incompatibilities to the Simple Plant Location Problem: Formulation, facets and computational experience. Comput. Oper. Res. 104: 174-190 (2019) - [j3]Alfredo Marín, Mercedes Pelegrín:
A new lifting theorem for vertex packing. Optim. Lett. 13(6): 1299-1312 (2019) - 2018
- [j2]Alfredo Marín, Mercedes Pelegrín-García:
Towards unambiguous map labeling - Integer programming approach and heuristic algorithm. Expert Syst. Appl. 98: 221-241 (2018) - 2017
- [j1]Mercedes Pelegrín, Blas Pelegrín:
Nash equilibria in location games on a network. OR Spectr. 39(3): 775-791 (2017) - 2015
- [c1]Emilio Muñoz-Velasco, Mercedes Pelegrín-García, Pietro Sala, Guido Sciavicco:
On Coarser Interval Temporal Logics and their Satisfiability Problem. CAEPIA 2015: 105-115
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-07-08 21:27 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:
