Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSergio García 0001
Person information
- affiliation: University of Edinburgh, School of Mathematics, UK
- affiliation (2012 - 2013): University of Kent, Kent Business School, Chatham, UK
- affiliation (2006 - 2012): University Carlos III, Department of Statistics, Leganés, Spain
- affiliation (PhD 2006): University of Murcia, Department of Mathematics, Spain
Other persons with the same name
- Sergio García — disambiguation page
- Sergio García 0002
![[0000-0001-7369-2480]](https://dblp.dagstuhl.de/img/orcid-mark.12x12.png "0000-0001-7369-2480")
(aka: Sergio García Gonzalo) — Chalmers University of Technology, Gothenburg, Sweden - Sergio García 0003 — LSR-IMAG, Grenoble, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j16]M. Barkhagen, Sergio García, Jacek Gondzio, Jörg Kalcsics, J. Kroeske, Sotirios Sabanis, A. Staal:
Optimising portfolio diversification and dimensionality. J. Glob. Optim. 85(1): 185-234 (2023)- [j15]Xavier Cabezas, Sergio García:
A semi-Lagrangian relaxation heuristic algorithm for the simple plant location problem with order. J. Oper. Res. Soc. 74(11): 2391-2402 (2023) - [i2]Marta Baldomero-Naranjo, Víctor Blanco, Sergio García, Ricardo Gázquez, Jörg Kalcsics, Luisa I. Martínez-Merino, Juan Manuel Muñoz-Ocaña, Francisco Temprano, Alberto Torrejón:
Proceedings of the XII International Workshop on Locational Analysis and Related Problems. CoRR abs/2309.08337 (2023) - 2022
- [j14]Maxence Delorme, Sergio García, Jacek Gondzio, Jörg Kalcsics, David F. Manlove, William Pettersson, James Trimble:
Improved instance generation for kidney exchange programmes. Comput. Oper. Res. 141: 105707 (2022) - 2021
- [j13]William Pettersson, Maxence Delorme, Sergio García, Jacek Gondzio, Jörg Kalcsics, David F. Manlove:
Improving solution times for stable matching problems through preprocessing. Comput. Oper. Res. 128: 105128 (2021) - [j12]Xavier Cabezas, Sergio García, Carlos Martín-Barreiro, Erwin Delgado, Victor Leiva-Sánchez:
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 21(16): 5352 (2021)
2010 – 2019
- 2019
- [j11]Maxence Delorme, Sergio García, Jacek Gondzio, Jörg Kalcsics, David F. Manlove, William Pettersson:
Mathematical models for stable matching problems with ties and incomplete lists. Eur. J. Oper. Res. 277(2): 426-441 (2019) - 2018
- [j10]Lukas Schäfer, Sergio García, Andreas Mitschke, Vassili Srithammavanh:
Redundancy system design for an aircraft door management system. Comput. Oper. Res. 94: 11-22 (2018) - [j9]Stefano Benati, Sergio García, Justo Puerto:
Mixed integer linear programming and heuristic methods for feature selection in clustering. J. Oper. Res. Soc. 69(9): 1379-1395 (2018) - [j8]Lukas Schäfer, Sergio García, Vassili Srithammavanh:
Simplification of inclusion-exclusion on intersections of unions with application to network systems reliability. Reliab. Eng. Syst. Saf. 173: 23-33 (2018) - [i1]Maxence Delorme, Sergio García, Jacek Gondzio, Jörg Kalcsics, David F. Manlove, William Pettersson:
Mathematical models for stable matching problems with ties and incomplete lists. CoRR abs/1810.02711 (2018) - 2014
- [j7]Leonardo Berbotto, Sergio García, Francisco J. Nogales:
A Randomized Granular Tabu Search heuristic for the split delivery vehicle routing problem. Ann. Oper. Res. 222(1): 153-173 (2014) - [j6]Stefano Benati, Sergio García:
A mixed integer linear model for clustering with variable selection. Comput. Oper. Res. 43: 280-285 (2014) - 2013
- [j5]Jesse R. O'Hanley, Maria Paola Scaparra, Sergio García:
Probability chains: A general linearization technique for modeling reliability in facility location and related problems. Eur. J. Oper. Res. 230(1): 63-75 (2013) - 2012
- [j4]Sergio García, Mercedes Landete, Alfredo Marín:
New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem. Eur. J. Oper. Res. 220(1): 48-57 (2012) - 2011
- [j3]Sergio García, Martine Labbé, Alfredo Marín:
Solving Large p-Median Problems with a Radius Formulation. INFORMS J. Comput. 23(4): 546-556 (2011)
2000 – 2009
- 2007
- [j2]Lázaro Cánovas, Sergio García, Alfredo Marín:
Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique. Eur. J. Oper. Res. 179(3): 990-1007 (2007) - [j1]Lázaro Cánovas, Sergio García, Martine Labbé, Alfredo Marín:
A strengthened formulation for the simple plant location problem with order. Oper. Res. Lett. 35(2): 141-150 (2007)
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-06-10 20:31 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:
