John E. Beasley

67 papers C 1Journal 65

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