J. Beasley

发表

A genetic algorithm for the set covering problem

J. Beasley, P. Chu, 1996 .

A note on solving large p-median problems

J. Beasley, 1985 .

A tree search algorithm for the p-median problem

Nicos Christofides, J. Beasley, 1982 .

Determining Teaching and Research Efficiencies

J. Beasley, 1995 .

Path finding methods accounting for stoichiometry in metabolic networks

Francisco J. Planes, J. Beasley, Jon Pey, 2011, Genome Biology.

Enhancing an algorithm for set covering problems

J. Beasley, K. Jörnsten, 1992 .

A lagrangian heuristic for set‐covering problems

J. Beasley, 1990 .

Lagrangean heuristics for location problems

J. Beasley, 1993 .

An algorithm for solving large capacitated warehouse location problems

J. Beasley, 1988 .

Population Heuristics

J. Beasley, 1999 .

Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem

Nicos Christofides, J. Beasley, 1983 .

A heuristic for Euclidean and rectilinear Steiner problems

J. Beasley, 1992 .

Bounds for Two-Dimensional Cutting

J. Beasley, 1985 .

A tree search algorithm for the crew scheduling problem

J. Beasley, B. Cao, 1996 .

An algorithm for set covering problem

J. Beasley, 1987 .

Strategies for corporate and business success--A survey

J. Beasley, 1985 .

Systems biology Recovering metabolic pathways via optimization

Francisco J. Planes, J. Beasley, M. Lardizábal, 2006 .

The Vehicle Routing-Allocation A Unifying Framework Problem"

E. M. Nascimento, J. Beasley, 1996 .

Portfolio rebalancing with an investment horizon and transaction costs

J. Beasley, C. Lucas, M. Woodside-Oriakhi, 2013 .

Adapting the savings algorithm for varying inter-customer travel times

J. Beasley, 1981 .

Vehicle routing with a sparse feasibility graph

Nicos Christofides, John E. Beasley, Nicos Christofides, 1997 .

Exchange-Traded Funds: A Market Snapshot and Performance Analysis

N. Meade, J. Beasley, C. Valle, 2014 .

Financially Efficient Dig-Line Delineation Incorporating Equipment Constraints and Grade Uncertainty

J. Beasley, A. Richmond, 2004 .

A nonlinear optimisation model for constructing minimal drawdown portfolios

J. Beasley, C. Valle, C. A. Valle, 2019, 1908.08684.

Quantitative portfolio selection: Using density forecasting to find consistent portfolios

N. Meade, J. Beasley, C. Adcock, 2019, Eur. J. Oper. Res..

An optimisation based approach to neighbourhood search

J. Beasley, 2022, 2207.03248.

Absolute return portfolios

John E. Beasley, Cristiano Arbex Valle, Nigel Meade, 2014 .

A heuristic for set covering using neighbourhood search optimisation

J. Beasley, 2022 .

An algorithm for the optimal solution of variable knockout problems

J. Beasley, 2019, 1908.02031.

Integrating gene and protein expression data with genome-scale metabolic networks to infer functional pathways

Angel Rubio, Francisco J. Planes, John E. Beasley, 2013, BMC Systems Biology.

A delaunay triangulation-based heuristic for the euclidean steiner problem

John E. Beasley, F. Goffinet, J. Beasley, 1994, Networks.

Consistency Regions and Frontiers: Using Density Forecasting to Find Consistent Portfolios

John E. Beasley, Nigel Meade, N. Meade, 2014 .

Heuristics for cardinality constrained portfolio optimisation

Yazid M. Sharaiha, John E. Beasley, Nigel Meade, 2000, Comput. Oper. Res..

A Genetic Algorithm for the Multidimensional Knapsack Problem

John E. Beasley, P. C. Chu, J. Beasley, 1998, J. Heuristics.

Computing the shortest elementary flux modes in genome-scale metabolic networks

Angel Rubio, Francisco J. Planes, Christoph Kaleta, 2009, Bioinform..

Advances in network-based metabolic pathway analysis and gene expression data integration

Angel Rubio, Francisco J. Planes, John E. Beasley, 2015, Briefings Bioinform..

Obtaining test problems via Internet

J. E. Beasley, J. Beasley, 1987 .

Comparing university departments

John E. Beasley, J. Beasley, 1990 .

Path finding approaches and metabolic pathways

Francisco J. Planes, John E. Beasley, J. Beasley, 2009, Discret. Appl. Math..

A critical examination of stoichiometric and path-finding approaches to metabolic pathways

Francisco J. Planes, John E. Beasley, J. Beasley, 2008, Briefings Bioinform..

Recovering metabolic pathways via optimization

Francisco J. Planes, John E. Beasley, J. Beasley, 2007, Bioinform..

OR-Library: Distributing Test Problems by Electronic Mail

John E. Beasley, J. Beasley, 1990 .

The period routing problem

Nicos Christofides, John E. Beasley, Nicos Christofides, 1984, Networks.

Allocating fixed costs and resources via data envelopment analysis

John E. Beasley, J. Beasley, 2003, Eur. J. Oper. Res..

A genetic algorithm for the generalised assignment problem

John E. Beasley, P. C. Chu, J. Beasley, 1997, Comput. Oper. Res..

Constraint Handling in Genetic Algorithms: The Set Partitioning Problem

John E. Beasley, P. C. Chu, J. Beasley, 1998, J. Heuristics.

The co-adaptive neural network approach to the Euclidean Travelling Salesman Problem

E. M. Cochrane, J. E. Beasley, J. Beasley, 2003, Neural Networks.

Placing boxes on shelves: a case study

John E. Beasley, N P Hoare, J. Beasley, 2001, J. Oper. Res. Soc..

A tabu search algorithm for the single vehicle routing allocation problem

John E. Beasley, Chandra A. Poojari, L. Vogt, 2007, J. Oper. Res. Soc..

The Vehicle Routing-Allocation Problem: A unifying framework

John E. Beasley, E. M. Nascimento, J. Beasley, 1996 .

A heuristic for the circle packing problem with a variety of containers

John E. Beasley, Claudia O. López, C. O. López, 2011, Eur. J. Oper. Res..

A heuristic algorithm for the period vehicle routing problem

John E. Beasley, C.C.R. Tan, J. Beasley, 1984 .

Order allocation, rack allocation and rack sequencing for pickers in a mobile rack environment pdf

John E. Beasley, Cristiano Arbex Valle, J. Beasley, 2019, Comput. Oper. Res..

A dynamic programming based algorithm for the crew scheduling problem

John E. Beasley, B. Cao, J. Beasley, 1998, Comput. Oper. Res..

Lagrangian relaxation

John E. Beasley, J. Beasley, 1993 .

Improving benders decomposition using a genetic algorithm

John E. Beasley, Chandra A. Poojari, J. Beasley, 2009, Eur. J. Oper. Res..

Restricting Weight Flexibility in Data Envelopment Analysis

John E. Beasley, Y.-H. B. Wong, J. Beasley, 1990 .

An algorithm for the resource constrained shortest path problem

Nicos Christofides, John E. Beasley, Nicos Christofides, 1989, Networks.

An Iterative Construction Heuristic for the Ore Selection Problem

John E. Beasley, A. J. Richmond, J. Beasley, 2004, J. Heuristics.

Route first--Cluster second methods for vehicle routing

John E. Beasley, J. Beasley, 1983 .

Metaheuristics with disposal facility positioning for the waste collection VRP with time windows

A. M. Benjamin, John E. Beasley, J. Beasley, 2013, Optim. Lett..

An evolutionary heuristic for the index tracking problem

John E. Beasley, Nigel Meade, T.-J. Chang, 2003, Eur. J. Oper. Res..

Factor neutral portfolios

John E. Beasley, Nigel Meade, Cristiano Arbex Valle, 2015, OR Spectr..

An optimisation approach to constructing an exchange-traded fund

John E. Beasley, Nigel Meade, Cristiano Arbex Valle, 2015, Optim. Lett..

A note on solving MINLP’s using formulation space search

John E. Beasley, Claudia O. López, C. O. López, 2013, Optimization Letters.

A note on solving MINLP’s using formulation space search

C. O. López, J. Beasley, 2013, Optimization Letters.

Corporate structure optimisation for multinational companies

John E. Beasley, J. Beasley, F. Anken, 2012 .

An algorithm for the two-dimensional assortment problem

J. Beasley, 1985 .

Scatter Search and Bionomic Algorithms for the aircraft landing problem

John E. Beasley, H. Pinol, J. Beasley, 2005, Eur. J. Oper. Res..

Scheduling Aircraft Landings - The Static Case

David Abramson, Yazid M. Sharaiha, John E. Beasley, 2000, Transp. Sci..

Quantile regression for index tracking and enhanced indexation

John E. Beasley, H. Mezali, J. Beasley, 2013, J. Oper. Res. Soc..

Index tracking with fixed and variable transaction costs

John E. Beasley, H. Mezali, J. Beasley, 2012, Optimization Letters.

An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure

John E. Beasley, J. Beasley, 1985, Oper. Res..

Optimally solving the joint order batching and picker routing problem pdf

Alexandre Salles da Cunha, John E. Beasley, Cristiano Arbex Valle, 2017, Eur. J. Oper. Res..

Displacement problem and dynamically scheduling aircraft landings

David Abramson, Yazid M. Sharaiha, John E. Beasley, 2004, J. Oper. Res. Soc..

Scheduling aircraft landings at London Heathrow using a population heuristic

John E. Beasley, J Sonander, P Havelock, 2001, J. Oper. Res. Soc..

Refining carbon flux paths using atomic trace data

Francisco J. Planes, John E. Beasley, Jon Pey, 2014, Bioinform..

A two-stage approach for order and rack allocation in a mobile rack environment

Cristiano Arbex Valle, John E Beasley, J. Beasley, 2021 .

TreeEFM: calculating elementary flux modes using linear optimization in a tree-based algorithm

Francisco J. Planes, José M. García, John E. Beasley, 2015, Bioinform..

Exploring the connectivity structure in metabolic networks: Going beyond graphs via discrete optimization

J. Beasley, Á. Rubio, J. Pey, 2011, 2011 IEEE Statistical Signal Processing Workshop (SSP).

An optimization model for metabolic pathways

Francisco J. Planes, John E. Beasley, J. Beasley, 2009, Bioinform..

A heuristic for the non-unicost set covering problem using local branching

J. Beasley, 2022, 2207.03248.

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

John E. Beasley, F. Alonso, M. Jesús Alvarez, 2008, J. Oper. Res. Soc..

Heuristic algorithms for the unconstrained binary quadratic programming problem

John E. Beasley, J. Beasley, 1998 .

Portfolio Optimisation: Models and Solution Approaches

John E. Beasley, J. Beasley, 2013 .

Heuristic algorithms for the cardinality constrained efficient frontier

C. Lucas, John E. Beasley, M. Woodside-Oriakhi, 2011, Eur. J. Oper. Res..

Order batching using an approximation for the distance travelled by pickers

Cristiano Arbex Valle, John E Beasley, J. Beasley, 2018, Eur. J. Oper. Res..

Modelling and Solving the Joint Order Batching and Picker Routing Problem in Inventories

Alexandre Salles da Cunha, John E. Beasley, Cristiano Arbex Valle, 2016, ISCO.

Market neutral portfolios

John E. Beasley, Nigel Meade, Cristiano Arbex Valle, 2014, Optim. Lett..

Mixed-integer programming approaches for index tracking and enhanced indexation

John E. Beasley, N. A. Canakgoz, J. Beasley, 2009, Eur. J. Oper. Res..

TreeEFM: calculating elementary flux modes using linear optimization in a tree-based algorithm

J. Beasley, J. M. García, L. Tobalina, 2015, Bioinform..

Computing the shortest elementary flux modes in genome-scale metabolic networks

S. Schuster, J. Beasley, C. Kaleta, 2009, Bioinform..

Supercomputers and OR

John E. Beasley, J. Beasley, 1987 .

Linear Programming on Cray Supercomputers

John E. Beasley, J. Beasley, 1990 .

The set covering problem

J E Beasley, J. Beasley, 1997 .

Algorithms for Unconstrained Two-Dimensional Guillotine Cutting

John E. Beasley, J. Beasley, 1985 .

Heuristic algorithms for the unconstrained binary quadratic programming problem

J. Beasley, 1998 .

A critical examination of stoichiometric and path-finding approaches to metabolic pathways

J. Beasley, F. J. Planes, 2008, Briefings Bioinform..

Detection of momentum effects using an index out-performance strategy

John E. Beasley, Nigel Meade, N. Meade, 2011 .

Obtaining test problems via Internet

John E. Beasley, J. Beasley, 1996, J. Glob. Optim..