Mercedes Pelegrín-García

Orcid: 0000-0001-6420-6794

According to our database1, Mercedes Pelegrín-García authored at least 15 papers between 2015 and 2023.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Urban air mobility: from complex tactical conflict resolution to network design and fairness insights.
Optim. Methods Softw., November, 2023

Aircraft Conflict Resolution: A Benchmark Generator.
INFORMS J. Comput., 2023

New variants of the simple plant location problem and applications.
Eur. J. Oper. Res., 2023

2022
Aircraft Deconfliction via Mathematical Programming: Review and Insights.
Transp. Sci., 2022

Continuous Covering on Networks: Strong Mixed Integer Programming Formulations.
CoRR, 2022

2021
Detecting and solving aircraft conflicts using bilevel programming.
J. Glob. Optim., 2021

Finding the root graph through minimum edge deletion.
Eur. J. Oper. Res., 2021

The double-assignment plant location problem with co-location.
Comput. Oper. Res., 2021

2020
Spotting Key Members in Networks: Clustering-Embedded Eigenvector Centrality.
IEEE Syst. J., 2020

2019
A new lifting theorem for vertex packing.
Optim. Lett., 2019

Adding incompatibilities to the Simple Plant Location Problem: Formulation, facets and computational experience.
Comput. Oper. Res., 2019

On coarser interval temporal logics.
Artif. Intell., 2019

2018
Towards unambiguous map labeling - Integer programming approach and heuristic algorithm.
Expert Syst. Appl., 2018

2017
Nash equilibria in location games on a network.
OR Spectr., 2017

2015
On Coarser Interval Temporal Logics and their Satisfiability Problem.
Proceedings of the Advances in Artificial Intelligence, 2015


  Loading...