John E. Beasley
Orcid: 0000-0002-4758-9970Affiliations:
- Brunel University London, UK
According to our database1,
John E. Beasley
authored at least 62 papers
between 1984 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on id.loc.gov
-
on d-nb.info
On csauthors.net:
Bibliography
2024
Int. Trans. Oper. Res., September, 2024
2022
EURO J. Comput. Optim., 2022
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
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
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
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
2013
Metaheuristics with disposal facility positioning for the waste collection VRP with time windows.
Optim. Lett., 2013
J. Oper. Res. Soc., 2013
Integrating gene and protein expression data with genome-scale metabolic networks to infer functional pathways.
BMC Syst. Biol., 2013
2011
Eur. J. Oper. Res., 2011
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
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009
Eur. J. Oper. Res., 2009
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
J. Oper. Res. Soc., 2007
2006
Eur. J. Oper. Res., 2006
2004
J. Oper. Res. Soc., 2004
J. Heuristics, 2004
Eur. J. Oper. Res., 2004
2003
The co-adaptive neural network approach to the Euclidean Travelling Salesman Problem.
Neural Networks, 2003
Eur. J. Oper. Res., 2003
2002
2001
J. Oper. Res. Soc., 2001
2000
Comput. Oper. Res., 2000
1999
1998
J. Heuristics, 1998
Comput. Oper. Res., 1998
1997
1996
1994
Networks, 1994
1989
1985
Oper. Res., 1985
1984