default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSeán McGarraghy
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j6]Angel A. Juan
, Peter B. Keenan, Rafael Martí, Seán McGarraghy, Javier Panadero, Paula Carroll, Diego Oliva:
A review of the role of heuristics in stochastic optimisation: from metaheuristics to learnheuristics. Ann. Oper. Res. 320(2): 831-861 (2023)- 2021
- [j5]Peter B. Keenan, Javier Panadero, Angel A. Juan, Rafael Martí, Seán McGarraghy:
A strategic oscillation simheuristic for the Time Capacitated Arc Routing Problem with stochastic demands. Comput. Oper. Res. 133: 105377 (2021) - [j4]Luis Gouveia, Seán McGarraghy, Cathal MacSwiney Brugha:
Introduction to Special Issue. Eur. J. Oper. Res. 291(3): 807 (2021)
2010 – 2019
- 2019
- [j3]Jésica de Armas, Peter B. Keenan, Angel A. Juan, Seán McGarraghy:
Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics. Ann. Oper. Res. 273(1-2): 135-162 (2019) - 2018
- [b2]Anthony Brabazon, Seán McGarraghy:
Foraging-Inspired Optimisation Algorithms. Natural Computing Series, Springer 2018, ISBN 978-3-319-59155-1, pp. 1-433 - 2015
- [b1]Anthony Brabazon, Michael O'Neill, Seán McGarraghy:
Natural Computing Algorithms. Natural Computing Series, Springer 2015, ISBN 978-3-662-43630-1, pp. 1-504 - 2013
- [j2]Paula Carroll, Seán McGarraghy:
A decomposition algorithm for the ring spur assignment problem. Int. Trans. Oper. Res. 20(1): 119-139 (2013) - [j1]Paula Carroll, Bernard Fortz, Martine Labbé, Seán McGarraghy:
A branch-and-cut algorithm for the ring spur assignment problem. Networks 61(2): 89-103 (2013) - [c7]David Fagan, Erik Hemberg, Michael O'Neill, Seán McGarraghy:
Understanding Expansion Order and Phenotypic Connectivity in πGE. EuroGP 2013: 37-48 - 2012
- [c6]David Fagan, Erik Hemberg, Miguel Nicolau, Michael O'Neill, Seán McGarraghy:
Towards adaptive mutation in grammatical evolution. GECCO (Companion) 2012: 1481-1482 - 2011
- [c5]David Fagan, Miguel Nicolau, Erik Hemberg, Michael O'Neill, Anthony Brabazon, Seán McGarraghy:
Investigation of the Performance of Different Mapping Orders for GE on the Max Problem. EuroGP 2011: 286-297 - [c4]Paula Carroll, Bernard Fortz, Martine Labbé, Seán McGarraghy:
Improved Formulations for the Ring Spur Assignment Problem. INOC 2011: 24-36 - 2010
- [c3]David Fagan, Miguel Nicolau, Michael O'Neill, Edgar Galván López, Anthony Brabazon, Seán McGarraghy:
Investigating mapping order in piGE. IEEE Congress on Evolutionary Computation 2010: 1-7 - [c2]David Fagan, Michael O'Neill, Edgar Galván López, Anthony Brabazon, Seán McGarraghy:
An Analysis of Genotype-Phenotype Maps in Grammatical Evolution. EuroGP 2010: 62-73
2000 – 2009
- 2008
- [p1]Kai Fan, Conall O'Sullivan, Anthony Brabazon, Michael O'Neill, Seán McGarraghy:
Calibration of the VGSSDOption Pricing Model using a Quantum-inspired Evolutionary Algorithm. Quantum Inspired Intelligent Systems 2008: 133-153 - 2004
- [c1]Michael O'Neill, Anthony Brabazon, Miguel Nicolau, Seán McGarraghy, Peter B. Keenan:
pi-Grammatical Evolution. GECCO (2) 2004: 617-629
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-03 21:36 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:
