An algorithm for the steiner problem in graphs. - John E. Beasley (Networks, 1984)

The period routing problem. - Nicos Christofides; John E. Beasley (Networks, 1984)

An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure. - John E. Beasley (Oper. Res., 1985)

An SST-based algorithm for the steiner problem in graphs. - John E. Beasley (Networks, 1989)

An algorithm for the resource constrained shortest path problem. - John E. Beasley; Nicos Christofides (Networks, 1989)

A delaunay triangulation-based heuristic for the euclidean steiner problem. - John E. Beasley; F. Goffinet (Networks, 1994)

Obtaining test problems via Internet. - John E. Beasley (J. Glob. Optim., 1996)

A genetic algorithm for the generalised assignment problem. - P. C. Chu; John E. Beasley (Comput. Oper. Res., 1997)

A dynamic programming based algorithm for the crew scheduling problem. - John E. Beasley; B. Cao (Comput. Oper. Res., 1998)

A Genetic Algorithm for the Multidimensional Knapsack Problem. - P. C. Chu; John E. Beasley (J. Heuristics, 1998)

Constraint Handling in Genetic Algorithms: The Set Partitioning Problem. - P. C. Chu; John E. Beasley (J. Heuristics, 1998)

A branch and cut algorithm for the Steiner problem in graphs. - Abilio Lucena; John E. Beasley (Networks, 1998)

Foreword. - Yazid M. Sharaiha; John E. Beasley (Ann. Oper. Res., 1999)

Heuristics for cardinality constrained portfolio optimisation. - T.-J. Chang; Nigel Meade; John E. Beasley; Yazid M. Sharaiha (Comput. Oper. Res., 2000)

Scheduling Aircraft Landings - The Static Case. - John E. Beasley; Mohan Krishnamoorthy; Yazid M. Sharaiha; David Abramson 001 (Transp. Sci., 2000)

Scheduling aircraft landings at London Heathrow using a population heuristic. - John E. Beasley; Julia Sonander; P. Havelock (J. Oper. Res. Soc., 2001)

Placing boxes on shelves: a case study. - N. P. Hoare; John E. Beasley (J. Oper. Res. Soc., 2001)

Improving short-term conflict alert via tabu search. - John E. Beasley; H. Howells; Julia Sonander (J. Oper. Res. Soc., 2002)

Allocating fixed costs and resources via data envelopment analysis. - John E. Beasley (Eur. J. Oper. Res., 2003)

An evolutionary heuristic for the index tracking problem. - John E. Beasley; Nigel Meade; T.-J. Chang (Eur. J. Oper. Res., 2003)

The co-adaptive neural network approach to the Euclidean Travelling Salesman Problem. - E. M. Cochrane; John E. Beasley (Neural Networks, 2003)

A population heuristic for constrained two-dimensional non-guillotine cutting. - John E. Beasley (Eur. J. Oper. Res., 2004)

An Iterative Construction Heuristic for the Ore Selection Problem. - A. J. Richmond; John E. Beasley (J. Heuristics, 2004)

Displacement problem and dynamically scheduling aircraft landings. - John E. Beasley; Mohan Krishnamoorthy; Yazid M. Sharaiha; David Abramson 001 (J. Oper. Res. Soc., 2004)

Scatter Search and Bionomic Algorithms for the aircraft landing problem. - H. Pinol; John E. Beasley (Eur. J. Oper. Res., 2006)

Recovering metabolic pathways via optimization. - John E. Beasley; Francisco J. Planes (Bioinform., 2007)

A tabu search algorithm for the single vehicle routing allocation problem. - L. Vogt; Chandra A. Poojari; John E. Beasley (J. Oper. Res. Soc., 2007)

A critical examination of stoichiometric and path-finding approaches to metabolic pathways. - Francisco J. Planes; John E. Beasley (Briefings Bioinform., 2008)

A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions. - F. Alonso; M. Jesús Alvarez; John E. Beasley (J. Oper. Res. Soc., 2008)

Computing the shortest elementary flux modes in genome-scale metabolic networks. - Luis F. de Figueiredo; Adam Podhorski; Angel Rubio; Christoph Kaleta; John E. Beasley; Stefan Schuster; Francisco J. Planes (Bioinform., 2009)

An optimization model for metabolic pathways. - Francisco J. Planes; John E. Beasley (Bioinform., 2009)

Path finding approaches and metabolic pathways. - Francisco J. Planes; John E. Beasley (Discret. Appl. Math., 2009)

Mixed-integer programming approaches for index tracking and enhanced indexation. - N. A. Canakgoz; John E. Beasley (Eur. J. Oper. Res., 2009)

Improving benders decomposition using a genetic algorithm. - Chandra A. Poojari; John E. Beasley (Eur. J. Oper. Res., 2009)

Multidimensional Knapsack Problems. - John E. Beasley (Encyclopedia of Optimization, 2009)

Metaheuristics for the waste collection vehicle routing problem with time windows, driver rest period and multiple disposal facilities. - Aida Mauziah Benjamin; John E. Beasley (Comput. Oper. Res., 2010)

A heuristic for the circle packing problem with a variety of containers. - Claudia O. López; John E. Beasley (Eur. J. Oper. Res., 2011)

Heuristic algorithms for the cardinality constrained efficient frontier. - Maria Woodside-Oriakhi; Cormac Lucas; John E. Beasley (Eur. J. Oper. Res., 2011)

Optimisation of sludge treatment and transport. - G. Mitchell; John E. Beasley (J. Oper. Res. Soc., 2011)

Integrating gene and protein expression data with genome-scale metabolic networks to infer functional pathways. - Jon Pey; Kaspar Valgepea; Angel Rubio; John E. Beasley; Francisco J. Planes (BMC Syst. Biol., 2013)

Packing unequal circles using formulation space search. - Claudia O. López; John E. Beasley (Comput. Oper. Res., 2013)

Quantile regression for index tracking and enhanced indexation. - H. Mezali; John E. Beasley (J. Oper. Res. Soc., 2013)

Metaheuristics with disposal facility positioning for the waste collection VRP with time windows. - Aida Mauziah Benjamin; John E. Beasley (Optim. Lett., 2013)

Refining carbon flux paths using atomic trace data. - Jon Pey; Francisco J. Planes; John E. Beasley (Bioinform., 2014)

A note on solving MINLP's using formulation space search. - Claudia O. López; John E. Beasley (Optim. Lett., 2014)

Index tracking with fixed and variable transaction costs. - H. Mezali; John E. Beasley (Optim. Lett., 2014)

Market neutral portfolios. - Cristiano Arbex Valle; Nigel Meade; John E. Beasley (Optim. Lett., 2014)

Advances in network-based metabolic pathway analysis and gene expression data integration. - Alberto Rezola; Jon Pey; Luis Tobalina; Ángel Rubio; John E. Beasley; Francisco J. Planes (Briefings Bioinform., 2015)

TreeEFM: calculating elementary flux modes using linear optimization in a tree-based algorithm. - Jon Pey; Juan A. Villar; Luis Tobalina; Alberto Rezola; José Manuel García Carrasco; John E. Beasley; Francisco J. Planes (Bioinform., 2015)

An optimisation approach to constructing an exchange-traded fund. - Cristiano Arbex Valle; Nigel Meade; John E. Beasley (Optim. Lett., 2015)

Factor neutral portfolios. - Cristiano Arbex Valle; Nigel Meade; John E. Beasley (OR Spectr., 2015)

Modelling and Solving the Joint Order Batching and Picker Routing Problem in Inventories. - Cristiano Arbex Valle; John E. Beasley; Alexandre Salles da Cunha (ISCO, 2016)

A formulation space search heuristic for packing unequal circles in a fixed size circular container. - Claudia O. López; John E. Beasley (Eur. J. Oper. Res., 2016)

Optimally solving the joint order batching and picker routing problem. - Cristiano Arbex Valle; John E. Beasley; Alexandre Salles da Cunha (Eur. J. Oper. Res., 2017)

Packing unequal rectangles and squares in a fixed size circular container using formulation space search. - Claudia O. López; John E. Beasley (Comput. Oper. Res., 2018)

Packing a fixed number of identical circles in a circular container with circular prohibited areas. - Claudia O. López; John E. Beasley (Optim. Lett., 2019)

Order batching using an approximation for the distance travelled by pickers. - Cristiano Arbex Valle; John E. Beasley (Eur. J. Oper. Res., 2020)

Order allocation, rack allocation and rack sequencing for pickers in a mobile rack environment. - Cristiano Arbex Valle; John E. Beasley (Comput. Oper. Res., 2021)

Quantitative portfolio selection: Using density forecasting to find consistent portfolios. - Nigel Meade; John E. Beasley; Christopher J. Adcock (Eur. J. Oper. Res., 2021)

A discrete optimisation approach for target path planning whilst evading sensors. - John E. Beasley (Comput. Oper. Res., 2022)

An optimisation model for minimising changes in frequency allocations. - John E. Beasley (EURO J. Comput. Optim., 2022)

A heuristic for the non-unicost set covering problem using local branching. - John E. Beasley (Int. Trans. Oper. Res., 2024)

An optimal algorithm for variable knockout problems. - John E. Beasley (4OR, 2024)

A two stage approach for order and rack allocation with order backlog in a mobile rack environment. - Cristiano Arbex Valle; John E. Beasley (Ann. Oper. Res., 2025)