Andrew J Parkes

Citata da

	Tutte	Dal 2020
Citazioni	4539	1026
Indice H	35	18
i10-index	66	33

260

130

195

198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202549 41 25 47 38 12 20 19 35 43 62 64 41 58 37 44 48 66 73 74 73 79 103 106 136 147 207 200 239 258 219 213 223 220 205 236 202 202 165 16

Accesso pubblico

Visualizza tutto

15 articoli

0 articoli

Disponibili

Non disponibili

In base ai mandati di finanziamento

Coautori

Edmund Kieran BurkeBangor UniversityEmail verificata su bangor.ac.uk
Barry McCollumSenior Lecturer, Computer Science, Queen's UniversityEmail verificata su qub.ac.uk
Ender ÖzcanProfessor of Computer Science and Operations Research, University of NottinghamEmail verificata su nottingham.ac.uk
Jakub MarečekCzech Technical University in PragueEmail verificata su fel.cvut.cz
Hana RudováMasaryk University, Czech RepublicEmail verificata su fi.muni.cz
Daniel KarapetyanSchool of Computer Science, University of NottinghamEmail verificata su nottingham.ac.uk
Professor Graham KendallMILA UniversityEmail verificata su mila.edu.my
Ahmed KheiriUniversity of ManchesterEmail verificata su manchester.ac.uk
Matthew R. HydeSenior Research Fellow, University of NottinghamEmail verificata su nottingham.ac.uk
Gabriela OchoaProfessor of Computer Science, University of StirlingEmail verificata su cs.stir.ac.uk
Dario Landa-SilvaUniversity of NottinghamEmail verificata su nottingham.ac.uk
Hugo Terashima-MarínTecnológico de MonterreyEmail verificata su tec.mx
José Carlos Ortiz-BaylissTecnológico de MonterreyEmail verificata su tec.mx
Michel GendreauProfessor of Operations Research, École Polytechnique de MontréalEmail verificata su cirrelt.net
Sanja PetrovicProfessor of Operational Research, Nottingham University Business SchoolEmail verificata su nottingham.ac.uk
Ahmad MuklasonDepartment of Information Systems, Institut Teknologi Sepuluh NopemberEmail verificata su is.its.ac.id
Olaf LechtenfeldProfessor of Theoretical Physics, Leibniz University HannoverEmail verificata su itp.uni-hannover.de
Jingpeng LiReader of Computer Science, University of Stirling, UKEmail verificata su cs.stir.ac.uk
Ben PaechterEdinburgh Napier UniversityEmail verificata su napier.ac.uk
Luca Di GasperoAssociate Professor of Information Technology, University of UdineEmail verificata su uniud.it

Segui

Andrew J Parkes

School of Computer Science, University of Nottingham

Email verificata su cs.nott.ac.uk - Home page

Artificial Intelligence Operations Research Optimisation Scheduling Timetabling


Titolo Ordina per citazioni Ordina per anno Ordina per titolo	Citata da Citata da	Anno
A supernodal formulation of vertex colouring with applications in course timetabling EK Burke, J Mareček, AJ Parkes, H Rudová Annals of Operations Research 179, 105-130, 2010	337	2010
Setting the research agenda in automated timetabling: The second international timetabling competition B McCollum, A Schaerf, B Paechter, P McMullan, R Lewis, AJ Parkes, ... INFORMS Journal on Computing 22 (1), 120-130, 2010	314	2010
Finiteness in rigid supersymmetric theories A Parkes, P West Physics Letters B 138 (1-3), 99-104, 1984	309	1984
HyFlex: A Benchmark Framework for Cross-domain Heuristic Search G Ochoa, M Hyde, T Curtois, JA Vazquez-Rodriguez, J Walker, ... Lecture Notes in Computer Science 7245, 136-147, 2012	229	2012
A survey of NP-complete puzzles G Kendall, A Parkes, K Spoerer ICGA Journal 31 (1), 13-34, 2008	208	2008
Supermodels and robustness ML Ginsberg, AJ Parkes, A Roy AAAI/IAAI, 334-339, 1998	138	1998
Three-loop results in two-loop finite supersymmetric gauge theories AJ Parkes, PC West Nuclear Physics B 256, 340-352, 1985	137	1985
Decomposition, reformulation, and diving in university course timetabling EK Burke, J Mareček, AJ Parkes, H Rudová Computers & Operations Research 37 (3), 582-597, 2010	133	2010
Combining Monte-Carlo and hyper-heuristic methods for the multi-mode resource-constrained multi-project scheduling problem S Asta, D Karapetyan, A Kheiri, E Özcan, AJ Parkes Information Sciences 373, 476-498, 2016	130	2016
A new model for automated examination timetabling B McCollum, P McMullan, AJ Parkes, EK Burke, R Qu Annals of Operations Research, 1-25, 2008	124	2008
Clustering at the phase transition AJ Parkes AAAI/IAAI, 340-345, 1997	117	1997
A cubic action for self-dual Yang-Mills A Parkes Physics Letters B 286 (3-4), 265-270, 1992	114	1992
Three-loop finiteness conditions in N = 1 super-Yang-Mills AJ Parkes Physics Letters B 156 (1), 73-79, 1985	102	1985
A branch-and-cut procedure for the Udine course timetabling problem EK Burke, J Mareček, AJ Parkes, H Rudová Annals of Operations Research, 1-17, 2012	96	2012
Search for a three-loop-finite chiral theory DRT Jones, AJ Parkes Physics Letters B 160 (4-5), 267-270, 1985	96	1985
An investigation of fuzzy multiple heuristic orderings in the construction of university examination timetables H Asmuni, EK Burke, JM Garibaldi, B McCollum, AJ Parkes Computers & Operations Research 36 (4), 981-1001, 2009	94	2009
Generalizing Boolean satisfiability I: Background and survey of existing work HE Dixon, ML Ginsberg, AJ Parkes J. Artif. Intell. Res. (JAIR) 21, 193-243, 2004	82	2004
An extended great deluge approach to the examination timetabling problem B McCollum, P McMullan, AJ Parkes, EK Burke, S Abdullah Proceedings of the 4th multidisciplinary international scheduling: Theory …, 2009	79	2009
Tuning local search for satisfiability testing AJ Parkes, JP Walser AAAI/IAAI, Vol. 1, 356-362, 1996	78	1996
Explicit supersymmetry breaking can preserve finiteness in rigid N = 2 supersymmetric theories A Parkes, P West Physics Letters B 127 (5), 353-359, 1983	74	1983

Il sistema al momento non può eseguire l'operazione. Riprova più tardi.

Articoli 1–20

Citazioni per anno

Citazioni duplicate

Citazioni unite

Aggiungi coautoriCoautori

Segui

Citata da

Coautori