 | 2012 |
|---|
| 9 |       | 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 |
| 8 | | Rhyd Lewis:
A time-dependent metaheuristic algorithm for post enrolment-based course timetabling.
Annals OR 194(1): 273-289 (2012) |
| 7 | | Rhyd Lewis,
Jonathan M. Thompson,
C. Mumford,
J. Gillard:
A wide-ranging computational comparison of high-performance graph colouring algorithms.
Computers & OR 39(9): 1933-1950 (2012) |
| 6 | | Xiang Song,
Rhyd Lewis,
Jonathan M. Thompson,
Yue Wu:
An incomplete m-exchange algorithm for solving the large-scale multi-scenario knapsack problem.
Computers & OR 39(9): 1988-2000 (2012) |
| 2011 |
|---|
| 5 | | Rhyd Lewis,
Jonathan M. Thompson:
On the application of graph colouring techniques in round-robin sports scheduling.
Computers & OR 38(1): 190-204 (2011) |
| 4 | | Rhyd Lewis,
X. Song,
Kathryn A. Dowsland,
Jonathan M. Thompson:
An investigation into two bin packing problems with ordering and orientation implications.
European Journal of Operational Research 213(1): 52-65 (2011) |
| 2010 |
|---|
| 3 | | X. 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.
European Journal of Operational Research 202(2): 368-378 (2010) |
| 2009 |
|---|
| 2 | | Rhyd Lewis:
A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing.
Computers & OR 36(7): 2295-2310 (2009) |
| 2007 |
|---|
| 1 | | Rhyd Lewis:
Metaheuristics can solve sudoku puzzles.
J. Heuristics 13(4): 387-401 (2007) |
Data released under the ODC-BY 1.0 license — See also our legal information page