default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrew J. Parkes
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[i13]Daniel Karapetyan, Andrew J. Parkes:
Enhancing Security via Deliberate Unpredictability of Solutions in Optimisation. CoRR abs/2101.06243 (2021)- 2020
- [j24]Tianxiang Cui
, Ruibin Bai, Shusheng Ding, Andrew J. Parkes, Rong Qu, Fang He, Jingpeng Li:
A hybrid combinatorial approach to a two-stage stochastic portfolio optimization model with uncertain asset prices. Soft Comput. 24(4): 2809-2831 (2020)
2010 – 2019
- 2019
- [j23]Daniel Karapetyan, Andrew J. Parkes, Gregory Z. Gutin, Andrei Gagarin:
Pattern-Based Approach to the Workflow Satisfiability Problem with User-Independent Constraints. J. Artif. Intell. Res. 66: 85-122 (2019) - [c33]Grazziela P. Figueredo, Peng Shi, Andrew J. Parkes, Keith Evans, Jonathan M. Garibaldi, Ola Negm, Patrick James Tighe, Herbert F. Sewell, John Robertson:
A Hybrid Evolutionary Strategy to Optimise Early-Stage Cancer Screening. CEC 2019: 95-102 - [i12]Jakub Marecek, Andrew J. Parkes:
Semidefinite Programming in Timetabling and Mutual-Exclusion Scheduling. CoRR abs/1904.03539 (2019) - 2018
- [j22]Adam N. Letchford, Andrew J. Parkes:
A guide to conic optimisation and its applications. RAIRO Oper. Res. 52(4): 1087-1106 (2018) - [c32]Andrew J. Parkes, Neema Beglou, Ender Özcan:
Learning the Quality of Dispatch Heuristics Generated by Automated Programming. LION 2018: 154-158 - [c31]Daniel Karapetyan, Andrew J. Parkes, Thomas Stützle:
Algorithm Configuration: Learning Policies for the Quick Termination of Poor Performers. LION 2018: 220-224 - [i11]Daniel Karapetyan, Andrew J. Parkes, Thomas Stützle:
Algorithm Configuration: Learning policies for the quick termination of poor performers. CoRR abs/1803.09785 (2018) - 2017
- [j21]Daniel Karapetyan, Jason A. D. Atkin, Andrew J. Parkes, Juan Castro-Gutierrez:
Lessons from building an automated pre-departure sequencer for airports. Ann. Oper. Res. 252(2): 435-453 (2017) - [j20]Ahmad Muklason, Andrew J. Parkes, Ender Özcan, Barry McCollum, Paul McMullan:
Fairness in examination timetabling: Student preferences and extended formulations. Appl. Soft Comput. 55: 302-318 (2017) - [j19]Daniel Karapetyan, Abraham P. Punnen, Andrew J. Parkes:
Markov Chain methods for the Bipartite Boolean Quadratic Programming Problem. Eur. J. Oper. Res. 260(2): 494-506 (2017) - [j18]Nonthachote Chatsanga, Andrew J. Parkes:
International portfolio optimisation with integrated currency overlay costs and constraints. Expert Syst. Appl. 83: 333-349 (2017) - [c30]Andrew W. Burnett, Andrew J. Parkes:
Exploring the landscape of the space of heuristics for local search in SAT. CEC 2017: 2518-2525 - [i10]Nonthachote Chatsanga, Andrew J. Parkes:
Two-Stage Stochastic International Portfolio Optimisation under Regular-Vine-Copula-Based Scenarios. CoRR abs/1704.01174 (2017) - 2016
- [j17]Ahmed Kheiri, Ender Özcan, Andrew J. Parkes:
A stochastic local search algorithm with adaptive acceptance for high-school timetabling. Ann. Oper. Res. 239(1): 135-151 (2016) - [j16]Shahriar Asta, Ender Özcan, Andrew J. Parkes:
CHAMP: Creating heuristics via many parameters for online bin packing. Expert Syst. Appl. 63: 208-221 (2016) - [j15]Shahriar Asta, Daniel Karapetyan, Ahmed Kheiri, Ender Özcan, Andrew J. Parkes:
Combining Monte-Carlo and hyper-heuristic methods for the multi-mode resource-constrained multi-project scheduling problem. Inf. Sci. 373: 476-498 (2016) - [i9]Daniel Karapetyan, Andrew J. Parkes, Gregory Z. Gutin, Andrei Gagarin:
Pattern-Based Approach to the Workflow Satisfiability Problem with User-Independent Constraints. CoRR abs/1604.05636 (2016) - [i8]Daniel Karapetyan, Abraham P. Punnen, Andrew J. Parkes:
Multi-component approach to the bipartite Boolean quadratic programming problem. CoRR abs/1605.02038 (2016) - [i7]Nonthachote Chatsanga, Andrew J. Parkes:
International Portfolio Optimisation with Integrated Currency Overlay Costs and Constraints. CoRR abs/1611.01463 (2016) - 2015
- [c29]Tianxiang Cui, Ruibin Bai, Andrew J. Parkes, Fang He, Rong Qu, Jingpeng Li:
A hybrid genetic algorithm for a two-stage stochastic portfolio optimization with uncertain asset prices. CEC 2015: 2518-2525 - [c28]Andrew J. Parkes, Ender Özcan, Daniel Karapetyan:
A Software Interface for Supporting the Application of Data Science to Optimisation. LION 2015: 306-311 - [i6]Shahriar Asta, Daniel Karapetyan, Ahmed Kheiri, Ender Özcan, Andrew J. Parkes:
Combining Monte-Carlo and Hyper-heuristic methods for the Multi-mode Resource-constrained Multi-project Scheduling Problem. CoRR abs/1511.04387 (2015) - 2014
- [c27]Ahmet Yarimcam, Shahriar Asta, Ender Ozcan, Andrew J. Parkes:
Heuristic generation via parameter tuning for online bin packing. EALS 2014: 102-108 - [c26]Alexander E. I. Brownlee, Jerry Swan, Ender Özcan, Andrew J. Parkes:
Hyperion2: a toolkit for {meta-, hyper-} heuristic research. GECCO (Companion) 2014: 1133-1140 - 2013
- [c25]José Carlos Ortiz-Bayliss, Hugo Terashima-Marín, Ender Ozcan, Andrew J. Parkes, Santiago E. Conant-Pablos:
Exploring heuristic interactions in constraint satisfaction problems: A closer look at the hyper-heuristic space. IEEE Congress on Evolutionary Computation 2013: 3307-3314 - [c24]Tianxiang Cui, Jingpeng Li, John Robert Woodward, Andrew J. Parkes:
An ensemble based Genetic Programming system to predict English football premier league games. EAIS 2013: 138-143 - [c23]Shahriar Asta, Ender Özcan, Andrew J. Parkes, A. Sima Etaner-Uyar:
Generalizing Hyper-heuristics via Apprenticeship Learning. EvoCOP 2013: 169-178 - [c22]Shahriar Asta, Ender Özcan, Andrew J. Parkes:
Dimension reduction in the search for online bin packing policies. GECCO (Companion) 2013: 65-66 - [c21]Shahriar Asta, Ender Özcan, Andrew J. Parkes:
Batched Mode Hyper-heuristics. LION 2013: 404-409 - [c20]José Carlos Ortiz-Bayliss, Ender Ozcan, Andrew J. Parkes, Hugo Terashima-Marín:
A genetic programming hyper-heuristic: Turning features into heuristics for constraint satisfaction. UKCI 2013: 183-190 - 2012
- [j14]Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, Hana Rudová:
A branch-and-cut procedure for the Udine Course Timetabling problem. Ann. Oper. Res. 194(1): 71-87 (2012) - [j13]Barry McCollum, Paul McMullan, Andrew J. Parkes, Edmund K. Burke, Rong Qu:
A new model for automated examination timetabling. Ann. Oper. Res. 194(1): 291-315 (2012) - [j12]Ender Özcan, Andrew J. Parkes, Alpay Alkan:
The Interleaved Constructive Memetic Algorithm and its application to timetabling. Comput. Oper. Res. 39(10): 2310-2322 (2012) - [c19]Andrew J. Parkes, Ender Özcan, Matthew R. Hyde:
Matrix Analysis of Genetic Programming Mutation. EuroGP 2012: 158-169 - [c18]Gabriela Ochoa, Matthew R. Hyde, Timothy Curtois, José Antonio Vázquez Rodríguez, James D. Walker, Michel Gendreau, Graham Kendall, Barry McCollum, Andrew J. Parkes, Sanja Petrovic, Edmund K. Burke:
HyFlex: A Benchmark Framework for Cross-Domain Heuristic Search. EvoCOP 2012: 136-147 - [c17]José Carlos Ortiz-Bayliss, Hugo Terashima-Marín, Santiago Enrique Conant-Pablos, Ender Özcan, Andrew J. Parkes:
Improving the performance of vector hyper-heuristics through local search. GECCO 2012: 1269-1276 - 2011
- [j11]Jingpeng Li, Andrew J. Parkes, Edmund K. Burke:
Evolutionary Squeaky Wheel Optimization: A New Framework for Analysis. Evol. Comput. 19(3): 405-428 (2011) - [c16]José Carlos Ortiz-Bayliss, Hugo Terashima-Marín, Ender Özcan, Andrew J. Parkes:
On the idea of evolving decision matrix hyper-heuristics for solving constraint satisfaction problems. GECCO (Companion) 2011: 255-256 - [c15]Ender Özcan, Andrew J. Parkes:
Policy matrix evolution for generation of heuristics. GECCO 2011: 2011-2018 - [c14]Edmund K. Burke, Michel Gendreau, Matthew R. Hyde, Graham Kendall, Barry McCollum, Gabriela Ochoa, Andrew J. Parkes, Sanja Petrovic:
The Cross-Domain Heuristic Search Challenge - An International Research Competition. LION 2011: 631-634 - [c13]José Carlos Ortiz-Bayliss, Hugo Terashima-Marín, Ender Özcan, Andrew J. Parkes, Santiago Enrique Conant-Pablos:
Variable and Value Ordering Decision Matrix Hyper-heuristics: A Local Improvement Approach. MICAI (1) 2011: 125-136 - [i5]Heidi E. Dixon, Matthew L. Ginsberg, Andrew J. Parkes:
Generalizing Boolean Satisfiability I: Background and Survey of Existing Work. CoRR abs/1107.0040 (2011) - [i4]Heidi E. Dixon, Matthew L. Ginsberg, Eugene M. Luks, Andrew J. Parkes:
Generalizing Boolean Satisfiability II: Theory. CoRR abs/1109.2134 (2011) - [i3]Heidi E. Dixon, Matthew L. Ginsberg, David K. Hofer, Eugene M. Luks, Andrew J. Parkes:
Generalizing Boolean Satisfiability III: Implementation. CoRR abs/1109.2142 (2011) - 2010
- [j10]Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, Hana Rudová:
A supernodal formulation of vertex colouring with applications in course timetabling. Ann. Oper. Res. 179(1): 105-130 (2010) - [j9]Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, Hana Rudová:
Decomposition, reformulation, and diving in university course timetabling. Comput. Oper. Res. 37(3): 582-597 (2010) - [j8]Barry McCollum, Andrea Schaerf, Ben Paechter, Paul McMullan, Rhydian Lewis, Andrew J. Parkes, Luca Di Gaspero, Rong Qu, Edmund K. Burke:
Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition. INFORMS J. Comput. 22(1): 120-130 (2010) - [j7]Camille Beyrouthy, Edmund K. Burke, Barry McCollum, Paul McMullan, Andrew J. Parkes:
University space planning and space-type profiles. J. Sched. 13(4): 363-374 (2010) - [c12]José Carlos Ortiz-Bayliss, Ender Özcan, Andrew J. Parkes, Hugo Terashima-Marín:
Mapping the performance of heuristics for Constraint Satisfaction. IEEE Congress on Evolutionary Computation 2010: 1-8
2000 – 2009
- 2009
- [j6]Hishammuddin Asmuni, Edmund K. Burke, Jonathan M. Garibaldi, Barry McCollum, Andrew J. Parkes:
An investigation of fuzzy multiple heuristic orderings in the construction of university examination timetables. Comput. Oper. Res. 36(4): 981-1001 (2009) - [j5]Camille Beyrouthy, Edmund K. Burke, Dario Landa-Silva, Barry McCollum, Paul McMullan, Andrew J. Parkes:
Towards improving the utilization of university teaching space. J. Oper. Res. Soc. 60(1): 130-143 (2009) - [i2]Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, Hana Rudová:
Decomposition, Reformulation, and Diving in University Course Timetabling. CoRR abs/0903.1095 (2009) - 2008
- [j4]Graham Kendall, Andrew J. Parkes, Kristian Spoerer:
A Survey of NP-Complete Puzzles. J. Int. Comput. Games Assoc. 31(1): 13-34 (2008) - 2007
- [c11]Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, Hana Rudová:
Penalising Patterns in Timetables: Novel Integer Programming Formulations. OR 2007: 409-414 - [i1]Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, Hana Rudová:
On a Clique-Based Integer Programming Formulation of Vertex Colouring with Applications in Course Timetabling. CoRR abs/0710.3603 (2007) - 2006
- [c10]Camille Beyrouthy, Edmund K. Burke, Dario Landa Silva, Barry McCollum, Paul McMullan, Andrew J. Parkes:
The Teaching Space Allocation Problem with Splitting. PATAT 2006: 228-247 - 2005
- [j3]Heidi E. Dixon, Matthew L. Ginsberg, David K. Hofer, Eugene M. Luks, Andrew J. Parkes:
Generalizing Boolean Satisfiability III: Implementation. J. Artif. Intell. Res. 23: 441-531 (2005) - 2004
- [j2]Heidi E. Dixon, Matthew L. Ginsberg, Andrew J. Parkes:
Generalizing Boolean Satisfiability I: Background and Survey of Existing Work. J. Artif. Intell. Res. 21: 193-243 (2004) - [j1]Heidi E. Dixon, Matthew L. Ginsberg, Eugene M. Luks, Andrew J. Parkes:
Generalizing Boolean Satisfiability II: Theory. J. Artif. Intell. Res. 22: 481-534 (2004) - [c9]Heidi E. Dixon, Matthew L. Ginsberg, David K. Hofer, Eugene M. Luks, Andrew J. Parkes:
Implementing a Generalized Version of Resolution. AAAI 2004: 55-60 - 2002
- [c8]Andrew J. Parkes:
Easy Predictions for the Easy-Hard-Easy Transition. AAAI/IAAI 2002: 688-694 - [c7]Andrew J. Parkes:
Scaling Properties of Pure Random Walk on Random 3-SAT. CP 2002: 708-713 - 2000
- [c6]Matthew L. Ginsberg, Andrew J. Parkes:
Satisfiability Algorithms and Finite Quantification. KR 2000: 690-701
1990 – 1999
- 1999
- [c5]Charles B. McVey, David P. Clements, Barton C. Massey, Andrew J. Parkes:
Worldwide Aeronautical Route Planner. AAAI/IAAI 1999: 916-917 - 1998
- [c4]Matthew L. Ginsberg, Andrew J. Parkes, Amitabha Roy:
Supermodels and Robustness. AAAI/IAAI 1998: 334-339 - 1997
- [c3]Andrew J. Parkes:
Clustering at the Phase Transition. AAAI/IAAI 1997: 340-345 - 1996
- [c2]Andrew J. Parkes, Joachim P. Walser:
Tuning Local Search for Satisfiability Testing. AAAI/IAAI, Vol. 1 1996: 356-362 - 1995
- [c1]Andrew J. Parkes, Geraint A. Wiggins:
Logic Program Synthesis by Induction over Horn Clauses. LOPSTR 1995: 170
Coauthor Index
aka: Ender Ozcan
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-10-07 21:25 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:
