John E. Beasley

Publication Activity (10 Years)

Years Active: 1984-2024
Publications (10 Years): 18

Top Topics

Pareto Local Search

Routing Problem

Transaction Costs

Gene Expression

Top Venues

Eur. J. Oper. Res.

Comput. Oper. Res.

Publications

John E. Beasley
A heuristic for the non-unicost set covering problem using local branching. Int. Trans. Oper. Res. 31 (5) (2024)
John E. Beasley
An optimisation model for minimising changes in frequency allocations. EURO J. Comput. Optim. 10 (2022)
John E. Beasley
A discrete optimisation approach for target path planning whilst evading sensors. Comput. Oper. Res. 138 (2022)
Nigel Meade, John E. Beasley, C. J. Adcock
Quantitative portfolio selection: Using density forecasting to find consistent portfolios. Eur. J. Oper. Res. 288 (3) (2021)
John E. Beasley
A discrete optimisation approach for target path planning whilst evading sensors. CoRR (2021)
Cristiano Arbex Valle, John E. Beasley
Order allocation, rack allocation and rack sequencing for pickers in a mobile rack environment. Comput. Oper. Res. 125 (2021)
Cristiano Arbex Valle, John E. Beasley
Order batching using an approximation for the distance travelled by pickers. Eur. J. Oper. Res. 284 (2) (2020)
Claudia O. López, John E. Beasley
Packing a fixed number of identical circles in a circular container with circular prohibited areas. Optim. Lett. 13 (7) (2019)
Cristiano Arbex Valle, John E. Beasley
Order allocation, rack allocation and rack sequencing for pickers in a mobile rack environment. CoRR (2019)
Claudia O. López, John E. Beasley
Packing unequal rectangles and squares in a fixed size circular container using formulation space search. Comput. Oper. Res. 94 (2018)
Cristiano Arbex Valle, John E. Beasley, Alexandre Salles da Cunha
Optimally solving the joint order batching and picker routing problem. CoRR (2017)
Cristiano Arbex Valle, John E. Beasley, Alexandre Salles da Cunha
Optimally solving the joint order batching and picker routing problem. Eur. J. Oper. Res. 262 (3) (2017)
Claudia O. López, John E. Beasley
A formulation space search heuristic for packing unequal circles in a fixed size circular container. Eur. J. Oper. Res. 251 (1) (2016)
Cristiano Arbex Valle, John E. Beasley, Alexandre Salles da Cunha
Modelling and Solving the Joint Order Batching and Picker Routing Problem in Inventories. ISCO (2016)
Cristiano Arbex Valle, Nigel Meade, John E. Beasley
An optimisation approach to constructing an exchange-traded fund. Optim. Lett. 9 (4) (2015)
Jon Pey, Juan A. Villar, Luis Tobalina, Alberto Rezola, José Manuel García Carrasco, John E. Beasley, Francisco J. Planes
TreeEFM: calculating elementary flux modes using linear optimization in a tree-based algorithm. Bioinform. 31 (6) (2015)
Cristiano Arbex Valle, Nigel Meade, John E. Beasley
Factor neutral portfolios. OR Spectr. 37 (4) (2015)
Alberto Rezola, Jon Pey, Luis Tobalina, Ángel Rubio, John E. Beasley, Francisco J. Planes
Advances in network-based metabolic pathway analysis and gene expression data integration. Briefings Bioinform. 16 (2) (2015)
Claudia O. López, John E. Beasley
A note on solving MINLP's using formulation space search. Optim. Lett. 8 (3) (2014)
Cristiano Arbex Valle, Nigel Meade, John E. Beasley
Market neutral portfolios. Optim. Lett. 8 (7) (2014)
H. Mezali, John E. Beasley
Index tracking with fixed and variable transaction costs. Optim. Lett. 8 (1) (2014)
Jon Pey, Francisco J. Planes, John E. Beasley
Refining carbon flux paths using atomic trace data. Bioinform. 30 (7) (2014)
A. M. Benjamin, John E. Beasley
Metaheuristics with disposal facility positioning for the waste collection VRP with time windows. Optim. Lett. 7 (7) (2013)
Claudia O. López, John E. Beasley
Packing unequal circles using formulation space search. Comput. Oper. Res. 40 (5) (2013)
H. Mezali, John E. Beasley
Quantile regression for index tracking and enhanced indexation. J. Oper. Res. Soc. 64 (11) (2013)
Jon Pey, Kaspar Valgepea, Angel Rubio, John E. Beasley, Francisco J. Planes
Integrating gene and protein expression data with genome-scale metabolic networks to infer functional pathways. BMC Syst. Biol. 7 (2013)
Maria Woodside-Oriakhi, Cormac Lucas, John E. Beasley
Heuristic algorithms for the cardinality constrained efficient frontier. Eur. J. Oper. Res. 213 (3) (2011)
G. Mitchell, John E. Beasley
Optimisation of sludge treatment and transport. J. Oper. Res. Soc. 62 (6) (2011)
Claudia O. López, John E. Beasley
A heuristic for the circle packing problem with a variety of containers. Eur. J. Oper. Res. 214 (3) (2011)
A. M. Benjamin, John E. Beasley
Metaheuristics for the waste collection vehicle routing problem with time windows, driver rest period and multiple disposal facilities. Comput. Oper. Res. 37 (12) (2010)
Luis F. de Figueiredo, Adam Podhorski, Angel Rubio, Christoph Kaleta, John E. Beasley, Stefan Schuster, Francisco J. Planes
Computing the shortest elementary flux modes in genome-scale metabolic networks. Bioinform. 25 (23) (2009)
Francisco J. Planes, John E. Beasley
An optimization model for metabolic pathways. Bioinform. 25 (20) (2009)
N. A. Canakgoz, John E. Beasley
Mixed-integer programming approaches for index tracking and enhanced indexation. Eur. J. Oper. Res. 196 (1) (2009)
Francisco J. Planes, John E. Beasley
Path finding approaches and metabolic pathways. Discret. Appl. Math. 157 (10) (2009)
Chandra A. Poojari, John E. Beasley
Improving benders decomposition using a genetic algorithm. Eur. J. Oper. Res. 199 (1) (2009)
F. Alonso, M. Jesús Alvarez, John E. Beasley
A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions. J. Oper. Res. Soc. 59 (7) (2008)
Francisco J. Planes, John E. Beasley
A critical examination of stoichiometric and path-finding approaches to metabolic pathways. Briefings Bioinform. 9 (5) (2008)
John E. Beasley, Francisco J. Planes
Recovering metabolic pathways via optimization. Bioinform. 23 (1) (2007)
L. Vogt, Chandra A. Poojari, John E. Beasley
A tabu search algorithm for the single vehicle routing allocation problem. J. Oper. Res. Soc. 58 (4) (2007)
H. Pinol, John E. Beasley
Scatter Search and Bionomic Algorithms for the aircraft landing problem. Eur. J. Oper. Res. 171 (2) (2006)
A. J. Richmond, John E. Beasley
An Iterative Construction Heuristic for the Ore Selection Problem. J. Heuristics 10 (2) (2004)
John E. Beasley, Mohan Krishnamoorthy, Yazid M. Sharaiha, David Abramson
Displacement problem and dynamically scheduling aircraft landings. J. Oper. Res. Soc. 55 (1) (2004)
John E. Beasley
A population heuristic for constrained two-dimensional non-guillotine cutting. Eur. J. Oper. Res. 156 (3) (2004)
John E. Beasley
Allocating fixed costs and resources via data envelopment analysis. Eur. J. Oper. Res. 147 (1) (2003)
E. M. Cochrane, John E. Beasley
The co-adaptive neural network approach to the Euclidean Travelling Salesman Problem. Neural Networks 16 (10) (2003)
John E. Beasley, Nigel Meade, T.-J. Chang
An evolutionary heuristic for the index tracking problem. Eur. J. Oper. Res. 148 (3) (2003)
John E. Beasley, H. Howells, Julia Sonander
Improving short-term conflict alert via tabu search. J. Oper. Res. Soc. 53 (6) (2002)
John E. Beasley, Julia Sonander, P. Havelock
Scheduling aircraft landings at London Heathrow using a population heuristic. J. Oper. Res. Soc. 52 (5) (2001)
N. P. Hoare, John E. Beasley
Placing boxes on shelves: a case study. J. Oper. Res. Soc. 52 (6) (2001)
T.-J. Chang, Nigel Meade, John E. Beasley, Yazid M. Sharaiha
Heuristics for cardinality constrained portfolio optimisation. Comput. Oper. Res. 27 (13) (2000)
John E. Beasley, Mohan Krishnamoorthy, Yazid M. Sharaiha, David Abramson
Scheduling Aircraft Landings - The Static Case. Transp. Sci. 34 (2) (2000)
Yazid M. Sharaiha, John E. Beasley
Foreword. Ann. Oper. Res. 86 (1999)
P. C. Chu, John E. Beasley
A Genetic Algorithm for the Multidimensional Knapsack Problem. J. Heuristics 4 (1) (1998)
P. C. Chu, John E. Beasley
Constraint Handling in Genetic Algorithms: The Set Partitioning Problem. J. Heuristics 4 (4) (1998)
Abilio Lucena, John E. Beasley
A branch and cut algorithm for the Steiner problem in graphs. Networks 31 (1) (1998)
John E. Beasley, B. Cao
A dynamic programming based algorithm for the crew scheduling problem. Comput. Oper. Res. 25 (7-8) (1998)
P. C. Chu, John E. Beasley
A genetic algorithm for the generalised assignment problem. Comput. Oper. Res. 24 (1) (1997)
John E. Beasley
Obtaining test problems via Internet. J. Glob. Optim. 8 (4) (1996)
John E. Beasley, F. Goffinet
A delaunay triangulation-based heuristic for the euclidean steiner problem. Networks 24 (4) (1994)
John E. Beasley, Nicos Christofides
An algorithm for the resource constrained shortest path problem. Networks 19 (4) (1989)
John E. Beasley
An SST-based algorithm for the steiner problem in graphs. Networks 19 (1) (1989)
John E. Beasley
An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure. Oper. Res. 33 (1) (1985)
John E. Beasley
An algorithm for the steiner problem in graphs. Networks 14 (1) (1984)
Nicos Christofides, John E. Beasley
The period routing problem. Networks 14 (2) (1984)