John E. Beasley

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

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

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

Order allocation, rack allocation and rack sequencing for pickers in a mobile rack environment.
CoRR, 2019

2018
Packing unequal rectangles and squares in a fixed size circular container using formulation space search.
Computers & OR, 2018

2017
Optimally solving the joint order batching and picker routing problem.
European Journal of Operational Research, 2017

Optimally solving the joint order batching and picker routing problem.
CoRR, 2017

2016
A formulation space search heuristic for packing unequal circles in a fixed size circular container.
European Journal of Operational Research, 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 Spectrum, 2015

An optimisation approach to constructing an exchange-traded fund.
Optimization Letters, 2015

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

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

2014
Market neutral portfolios.
Optimization Letters, 2014

Index tracking with fixed and variable transaction costs.
Optimization Letters, 2014

A note on solving MINLP's using formulation space search.
Optimization Letters, 2014

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

2013
Metaheuristics with disposal facility positioning for the waste collection VRP with time windows.
Optimization Letters, 2013

Quantile regression for index tracking and enhanced indexation.
JORS, 2013

Packing unequal circles using formulation space search.
Computers & OR, 2013

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

2011
Optimisation of sludge treatment and transport.
JORS, 2011

Heuristic algorithms for the cardinality constrained efficient frontier.
European Journal of Operational Research, 2011

A heuristic for the circle packing problem with a variety of containers.
European Journal of Operational Research, 2011

2010
Metaheuristics for the waste collection vehicle routing problem with time windows, driver rest period and multiple disposal facilities.
Computers & OR, 2010

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

Improving benders decomposition using a genetic algorithm.
European Journal of Operational Research, 2009

Mixed-integer programming approaches for index tracking and enhanced indexation.
European Journal of Operational Research, 2009

Path finding approaches and metabolic pathways.
Discrete Applied Mathematics, 2009

An optimization model for metabolic pathways.
Bioinformatics, 2009

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

2008
A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions.
JORS, 2008

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

2007
A tabu search algorithm for the single vehicle routing allocation problem.
JORS, 2007

Recovering metabolic pathways via optimization.
Bioinformatics, 2007

2006
Scatter Search and Bionomic Algorithms for the aircraft landing problem.
European Journal of Operational Research, 2006

2004
Displacement problem and dynamically scheduling aircraft landings.
JORS, 2004

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

A population heuristic for constrained two-dimensional non-guillotine cutting.
European Journal of Operational Research, 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.
European Journal of Operational Research, 2003

Allocating fixed costs and resources via data envelopment analysis.
European Journal of Operational Research, 2003

2000
Scheduling Aircraft Landings - The Static Case.
Transportation Science, 2000

Heuristics for cardinality constrained portfolio optimisation.
Computers & OR, 2000

1999
Foreword.
Annals OR, 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.
Computers & OR, 1998

1997
A genetic algorithm for the generalised assignment problem.
Computers & OR, 1997

1996
Obtaining test problems via Internet.
J. Global Optimization, 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.
Operations Research, 1985

1984
The period routing problem.
Networks, 1984

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


  Loading...