Rhyd Lewis

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Soft happy colourings and community structure of networks Computers & Operations Research	2025-06-04	Paper
A user-centric model of connectivity in street networks Computers & Operations Research	2025-05-26	Paper
Effects of update frequencies in a dynamic capacitated arc routing problem Networks	2023-11-23	Paper
A Comparison of Dijkstra's Algorithm Using Fibonacci Heaps, Binary Heaps, and Self-Balancing Binary Trees	2023-03-17	Paper
Exact and approximate methods for the score-constrained packing problem European Journal of Operational Research	2022-06-08	Paper
The maximum happy induced subgraph problem: bounds and algorithms Computers & Operations Research	2021-05-21	Paper
Tackling the maximum happy vertices problem in large networks 4OR	2021-05-20	Paper
Heuristics for the score-constrained strip-packing problem	2019-10-11	Paper
Finding happiness: an analysis of the maximum happy vertices problem Computers & Operations Research	2018-12-17	Paper
Towards objective measures of algorithm performance across instance space Computers & Operations Research	2016-11-10	Paper
A time-dependent metaheuristic algorithm for post enrolment-based course timetabling Annals of Operations Research	2012-11-15	Paper
An incomplete m-exchange algorithm for solving the large-scale multi-scenario knapsack problem Computers & Operations Research	2012-11-15	Paper
Combining heuristic and exact methods to solve the vehicle routing problem with pickups, deliveries and time windows Evolutionary Computation in Combinatorial Optimization	2012-10-18	Paper
Setting the research agenda in automated timetabling: the second international timetabling competition INFORMS Journal on Computing	2012-07-28	Paper
An investigation into two bin packing problems with ordering and orientation implications European Journal of Operational Research	2012-05-14	Paper
A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing Computers & Operations Research	2009-04-17	Paper

Research outcomes over time

This page was built for person: Rhyd Lewis