Sergio García

Orcid: 0000-0003-4281-6916

Affiliations:
  • University of Edinburgh, School of Mathematics, UK
  • University of Kent, Kent Business School, Chatham, UK (2012 - 2013)
  • University Carlos III, Department of Statistics, Leganés, Spain (2006 - 2012)
  • University of Murcia, Department of Mathematics, Spain (PhD 2006)


According to our database1, Sergio García authored at least 17 papers between 2007 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
A semi-Lagrangian relaxation heuristic algorithm for the simple plant location problem with order.
J. Oper. Res. Soc., November, 2023

Optimising portfolio diversification and dimensionality.
J. Glob. Optim., 2023

Proceedings of the XII International Workshop on Locational Analysis and Related Problems.
CoRR, 2023

2022
Improved instance generation for kidney exchange programmes.
Comput. Oper. Res., 2022

2021
A Two-Stage Location Problem with Order Solved Using a Lagrangian Algorithm and Stochastic Programming for a Potential Use in COVID-19 Vaccination Based on Sensor-Related Data.
Sensors, 2021

Improving solution times for stable matching problems through preprocessing.
Comput. Oper. Res., 2021

2019
Mathematical models for stable matching problems with ties and incomplete lists.
Eur. J. Oper. Res., 2019

2018
Simplification of inclusion-exclusion on intersections of unions with application to network systems reliability.
Reliab. Eng. Syst. Saf., 2018

Mixed integer linear programming and heuristic methods for feature selection in clustering.
J. Oper. Res. Soc., 2018

Redundancy system design for an aircraft door management system.
Comput. Oper. Res., 2018

2014
A mixed integer linear model for clustering with variable selection.
Comput. Oper. Res., 2014

A Randomized Granular Tabu Search heuristic for the split delivery vehicle routing problem.
Ann. Oper. Res., 2014

2013
Probability chains: A general linearization technique for modeling reliability in facility location and related problems.
Eur. J. Oper. Res., 2013

2012
New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem.
Eur. J. Oper. Res., 2012

2011
Solving Large <i>p</i>-Median Problems with a Radius Formulation.
INFORMS J. Comput., 2011

2007
A strengthened formulation for the simple plant location problem with order.
Oper. Res. Lett., 2007

Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique.
Eur. J. Oper. Res., 2007


  Loading...