John E. Beasley

Orcid: 0000-0002-4758-9970

Affiliations:
  • Brunel University London, UK


According to our database1, John E. Beasley authored at least 62 papers between 1984 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A heuristic for the non-unicost set covering problem using local branching.
Int. Trans. Oper. Res., September, 2024

2022
An optimisation model for minimising changes in frequency allocations.
EURO J. Comput. Optim., 2022

A discrete optimisation approach for target path planning whilst evading sensors.
Comput. Oper. Res., 2022

2021
Quantitative portfolio selection: Using density forecasting to find consistent portfolios.
Eur. J. Oper. Res., 2021

Order allocation, rack allocation and rack sequencing for pickers in a mobile rack environment.
Comput. Oper. Res., 2021

2020
Order batching using an approximation for the distance travelled by pickers.
Eur. J. Oper. Res., 2020

2019
Packing a fixed number of identical circles in a circular container with circular prohibited areas.
Optim. Lett., 2019

2018
Packing unequal rectangles and squares in a fixed size circular container using formulation space search.
Comput. Oper. Res., 2018

2017
Optimally solving the joint order batching and picker routing problem.
Eur. J. Oper. Res., 2017

2016
A formulation space search heuristic for packing unequal circles in a fixed size circular container.
Eur. J. Oper. Res., 2016

Modelling and Solving the Joint Order Batching and Picker Routing Problem in Inventories.
Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016

2015
Factor neutral portfolios.
OR Spectr., 2015

An optimisation approach to constructing an exchange-traded fund.
Optim. Lett., 2015

TreeEFM: calculating elementary flux modes using linear optimization in a tree-based algorithm.
Bioinform., 2015

Advances in network-based metabolic pathway analysis and gene expression data integration.
Briefings Bioinform., 2015

2014
Market neutral portfolios.
Optim. Lett., 2014

Index tracking with fixed and variable transaction costs.
Optim. Lett., 2014

A note on solving MINLP's using formulation space search.
Optim. Lett., 2014

Refining carbon flux paths using atomic trace data.
Bioinform., 2014

2013
Metaheuristics with disposal facility positioning for the waste collection VRP with time windows.
Optim. Lett., 2013

Quantile regression for index tracking and enhanced indexation.
J. Oper. Res. Soc., 2013

Packing unequal circles using formulation space search.
Comput. Oper. Res., 2013

Integrating gene and protein expression data with genome-scale metabolic networks to infer functional pathways.
BMC Syst. Biol., 2013

2011
Optimisation of sludge treatment and transport.
J. Oper. Res. Soc., 2011

Heuristic algorithms for the cardinality constrained efficient frontier.
Eur. J. Oper. Res., 2011

A heuristic for the circle packing problem with a variety of containers.
Eur. J. Oper. Res., 2011

2010
Metaheuristics for the waste collection vehicle routing problem with time windows, driver rest period and multiple disposal facilities.
Comput. Oper. Res., 2010

2009
Multidimensional Knapsack Problems.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Improving benders decomposition using a genetic algorithm.
Eur. J. Oper. Res., 2009

Mixed-integer programming approaches for index tracking and enhanced indexation.
Eur. J. Oper. Res., 2009

Path finding approaches and metabolic pathways.
Discret. Appl. Math., 2009

An optimization model for metabolic pathways.
Bioinform., 2009

Computing the shortest elementary flux modes in genome-scale metabolic networks.
Bioinform., 2009

2008
A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions.
J. Oper. Res. Soc., 2008

A critical examination of stoichiometric and path-finding approaches to metabolic pathways.
Briefings Bioinform., 2008

2007
A tabu search algorithm for the single vehicle routing allocation problem.
J. Oper. Res. Soc., 2007

Recovering metabolic pathways via optimization.
Bioinform., 2007

2006
Scatter Search and Bionomic Algorithms for the aircraft landing problem.
Eur. J. Oper. Res., 2006

2004
Displacement problem and dynamically scheduling aircraft landings.
J. Oper. Res. Soc., 2004

An Iterative Construction Heuristic for the Ore Selection Problem.
J. Heuristics, 2004

A population heuristic for constrained two-dimensional non-guillotine cutting.
Eur. J. Oper. Res., 2004

2003
The co-adaptive neural network approach to the Euclidean Travelling Salesman Problem.
Neural Networks, 2003

An evolutionary heuristic for the index tracking problem.
Eur. J. Oper. Res., 2003

Allocating fixed costs and resources via data envelopment analysis.
Eur. J. Oper. Res., 2003

2002
Improving short-term conflict alert via tabu search.
J. Oper. Res. Soc., 2002

2001
Placing boxes on shelves: a case study.
J. Oper. Res. Soc., 2001

Scheduling aircraft landings at London Heathrow using a population heuristic.
J. Oper. Res. Soc., 2001

2000
Scheduling Aircraft Landings - The Static Case.
Transp. Sci., 2000

Heuristics for cardinality constrained portfolio optimisation.
Comput. Oper. Res., 2000

1999
Foreword.
Ann. Oper. Res., 1999

1998
A branch and cut algorithm for the Steiner problem in graphs.
Networks, 1998

Constraint Handling in Genetic Algorithms: The Set Partitioning Problem.
J. Heuristics, 1998

A Genetic Algorithm for the Multidimensional Knapsack Problem.
J. Heuristics, 1998

A dynamic programming based algorithm for the crew scheduling problem.
Comput. Oper. Res., 1998

1997
A genetic algorithm for the generalised assignment problem.
Comput. Oper. Res., 1997

1996
Obtaining test problems via Internet.
J. Glob. Optim., 1996

1994
A delaunay triangulation-based heuristic for the euclidean steiner problem.
Networks, 1994

1989
An algorithm for the resource constrained shortest path problem.
Networks, 1989

An SST-based algorithm for the steiner problem in graphs.
Networks, 1989

1985
An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure.
Oper. Res., 1985

1984
The period routing problem.
Networks, 1984

An algorithm for the steiner problem in graphs.
Networks, 1984


  Loading...