default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJonathan M. Thompson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j18]Monique Sciortino
, Rhyd Lewis, Jonathan M. Thompson:
A School Bus Routing Heuristic Algorithm Allowing Heterogeneous Fleets and Bus Stop Selection. SN Comput. Sci. 4(1): 74 (2023)- 2022
- [j17]Asyl L. Hawa, Rhyd Lewis, Jonathan M. Thompson:
Exact and approximate methods for the score-constrained packing problem. Eur. J. Oper. Res. 302(3): 847-859 (2022) - 2021
- [c9]Monique Sciortino, Rhyd Lewis, Jonathan M. Thompson:
A Heuristic Algorithm for School Bus Routing with Bus Stop Selection. EvoCOP 2021: 202-218 - 2020
- [j16]Wasin Padungwech, Jonathan M. Thompson, Rhyd Lewis:
Effects of update frequencies in a dynamic capacitated arc routing problem. Networks 76(4): 522-538 (2020)
2010 – 2019
- 2018
- [j15]Bradley Hardy, Rhyd Lewis, Jonathan M. Thompson:
Tackling the edge dynamic graph colouring problem with and without future adjacency information. J. Heuristics 24(3): 321-343 (2018) - [c8]Asyl L. Hawa, Rhyd Lewis, Jonathan M. Thompson:
Heuristics for the Score-Constrained Strip-Packing Problem. COCOA 2018: 449-462 - 2017
- [c7]Khaled Alrajhi, Jonathan M. Thompson, Wasin Padungwech:
A Heuristic Approach for the Dynamic Frequency Assignment Problem. UKCI 2017: 91-103 - 2016
- [c6]Bradley Hardy, Rhyd Lewis, Jonathan M. Thompson:
Modifying Colourings Between Time-Steps to Tackle Changes in Dynamic Random Graphs. EvoCOP 2016: 186-201 - [c5]Wasin Padungwech, Jonathan M. Thompson, Rhyd Lewis:
Investigating Edge-Reordering Procedures in a Tabu Search Algorithm for the Capacitated Arc Routing Problem. HM 2016: 62-74 - [c4]Khaled Alrajhi, Jonathan M. Thompson, Wasin Padungwech:
Tabu Search Hybridized with Multiple Neighborhood Structures for the Frequency Assignment Problem. HM 2016: 157-170 - 2015
- [j14]Rhydian Lewis, Jonathan M. Thompson:
Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem. Eur. J. Oper. Res. 240(3): 637-648 (2015) - 2012
- [j13]Rhyd Lewis, Jonathan M. Thompson, Christine L. Mumford, J. Gillard:
A wide-ranging computational comparison of high-performance graph colouring algorithms. Comput. Oper. Res. 39(9): 1933-1950 (2012) - [j12]Xiang Song, Rhyd Lewis, Jonathan M. Thompson, Yue Wu:
An incomplete m-exchange algorithm for solving the large-scale multi-scenario knapsack problem. Comput. Oper. Res. 39(9): 1988-2000 (2012) - [j11]Melissa D. Goodman, Kathryn A. Dowsland, Jonathan M. Thompson:
Hybridising GRASP and network flows in the solution of a medical school scheduling problem. J. Sched. 15(6): 717-731 (2012) - [c3]Penny L. Holborn, Jonathan M. Thompson, Rhyd Lewis:
Combining Heuristic and Exact Methods to Solve the Vehicle Routing Problem with Pickups, Deliveries and Time Windows. EvoCOP 2012: 63-74 - [p1]Kathryn A. Dowsland, Jonathan M. Thompson:
Simulated Annealing. Handbook of Natural Computing 2012: 1623-1655 - 2011
- [j10]Rhyd Lewis, Jonathan M. Thompson:
On the application of graph colouring techniques in round-robin sports scheduling. Comput. Oper. Res. 38(1): 190-204 (2011) - [j9]Rhyd Lewis, Xiang Song, Kathryn A. Dowsland, Jonathan M. Thompson:
An investigation into two bin packing problems with ordering and orientation implications. Eur. J. Oper. Res. 213(1): 52-65 (2011) - 2010
- [j8]Xiang Song, C. B. Chu, Rhyd Lewis, Y. Y. Nie, Jonathan M. Thompson:
A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting. Eur. J. Oper. Res. 202(2): 368-378 (2010)
2000 – 2009
- 2009
- [j7]Melissa D. Goodman, Kathryn A. Dowsland, Jonathan M. Thompson:
A grasp-knapsack hybrid for a nurse-scheduling problem. J. Heuristics 15(4): 351-379 (2009) - 2008
- [j6]Kathryn A. Dowsland, Jonathan M. Thompson:
An improved ant colony optimisation heuristic for graph colouring. Discret. Appl. Math. 156(3): 313-324 (2008) - 2007
- [j5]D. Parr, Jonathan M. Thompson:
Solving the multi-objective nurse scheduling problem with a weighted cost function. Ann. Oper. Res. 155(1): 279-288 (2007) - 2005
- [j4]Kathryn A. Dowsland, Jonathan M. Thompson:
Ant colony optimization for the examination scheduling problem. J. Oper. Res. Soc. 56(4): 426-438 (2005) - 2002
- [c2]Stephen Casey, Jonathan M. Thompson:
GRASPing the Examination Scheduling Problem. PATAT 2002: 232-246 - 2000
- [j3]Kathryn A. Dowsland, Jonathan M. Thompson:
Solving a nurse scheduling problem with knapsacks, networks and tabu search. J. Oper. Res. Soc. 51(7): 825-833 (2000)
1990 – 1999
- 1998
- [j2]Jonathan M. Thompson, Kathryn A. Dowsland:
A robust simulated annealing based examination timetabling system. Comput. Oper. Res. 25(7-8): 637-648 (1998) - 1996
- [j1]Jonathan M. Thompson, Kathryn A. Dowsland:
Variants of simulated annealing for the examination timetabling problem. Ann. Oper. Res. 63(1): 105-128 (1996) - 1995
- [c1]Jonathan M. Thompson, Kathryn A. Dowsland:
General Cooling Schedules for a Simulated Annealing Based Timetabling System. PATAT 1995: 345-363
Coauthor Index
aka: Rhydian Lewis
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-04-24 22:49 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:
