default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohn Alasdair Warwicker
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2019
[b1]John Alasdair Warwicker:
On the runtime analysis of selection hyper-heuristics for pseudo-Boolean optimisation. University of Sheffield, UK, 2019
Journal Articles
- 2024
- [j5]John Alasdair Warwicker
, Steffen Rebennack:
Support vector machines within a bivariate mixed-integer linear programming framework. Expert Syst. Appl. 245: 122998 (2024) - 2023
- [j4]Andrei Lissovoi, Pietro S. Oliveto, John Alasdair Warwicker:
When move acceptance selection hyper-heuristics outperform Metropolis and elitist evolutionary algorithms and when not. Artif. Intell. 314: 103804 (2023) - [j3]John Alasdair Warwicker, Steffen Rebennack:
A unified framework for bivariate clustering and regression problems via mixed-integer linear programming. Discret. Appl. Math. 336: 15-36 (2023) - 2022
- [j2]John Alasdair Warwicker, Steffen Rebennack:
A Comparison of Two Mixed-Integer Linear Programs for Piecewise Linear Function Fitting. INFORMS J. Comput. 34(2): 1042-1047 (2022) - 2020
- [j1]Andrei Lissovoi, Pietro S. Oliveto, John Alasdair Warwicker:
Simple Hyper-Heuristics Control the Neighbourhood Size of Randomised Local Search Optimally for LeadingOnes*. Evol. Comput. 28(3): 437-461 (2020)
Conference and Workshop Papers
- 2024
- [c6]Paul Fischer, John Alasdair Warwicker, Carsten Witt:
A Runtime Analysis of Bias-invariant Neuroevolution and Dynamic Fitness Evaluation. GECCO 2024 - 2023
- [c5]Issam Abdeldjalil Ikhelef, John Alasdair Warwicker, Steffen Rebennack, Mohand Yazid Saidi, Ken Chen:
Efficient Decomposition-Based Methods for Optimal VNF Placement and Chaining. APNOMS 2023: 89-94 - 2020
- [c4]Andrei Lissovoi, Pietro S. Oliveto, John Alasdair Warwicker:
How the Duration of the Learning Period Affects the Performance of Random Gradient Selection Hyper-Heuristics. AAAI 2020: 2376-2383 - 2019
- [c3]Andrei Lissovoi, Pietro S. Oliveto, John Alasdair Warwicker:
On the Time Complexity of Algorithm Selection Hyper-Heuristics for Multimodal Optimisation. AAAI 2019: 2322-2329 - 2018
- [c2]Benjamin Doerr, Andrei Lissovoi, Pietro S. Oliveto, John Alasdair Warwicker:
On the runtime analysis of selection hyper-heuristics with adaptive learning periods. GECCO 2018: 1015-1022 - 2017
- [c1]Andrei Lissovoi, Pietro S. Oliveto, John Alasdair Warwicker:
On the runtime analysis of generalised selection hyper-heuristics for pseudo-boolean optimisation. GECCO 2017: 849-856
Informal and Other Publications
- 2018
- [i1]Andrei Lissovoi, Pietro S. Oliveto, John Alasdair Warwicker:
Hyper-heuristics Can Achieve Optimal Performance for Pseudo-Boolean Optimisation. CoRR abs/1801.07546 (2018)
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-20 21:17 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:
