John E. Beasley

C. O. López, J. E. Beasley: Packing unequal circles using formulation space search. Computers & OR 40(5): 1276-1288 (2013)

M. Woodside-Oriakhi, C. Lucas, J. E. Beasley: Heuristic algorithms for the cardinality constrained efficient frontier. European Journal of Operational Research 213(3): 538-550 (2011)

C. O. López, John E. Beasley: A heuristic for the circle packing problem with a variety of containers. European Journal of Operational Research 214(3): 512-525 (2011)

G. Mitchell, J. E. Beasley: Optimisation of sludge treatment and transport. JORS 62(6): 939-948 (2011)

A. M. Benjamin, J. E. Beasley: Metaheuristics for the waste collection vehicle routing problem with time windows, driver rest period and multiple disposal facilities. Computers & OR 37(12): 2270-2280 (2010)

Francisco J. Planes, John E. Beasley: An optimization model for metabolic pathways. Bioinformatics 25(20): 2723-2729 (2009)

Luis F. de Figueiredo, Adam Podhorski, Angel Rubio, Christoph Kaleta, John E. Beasley, Stefan Schuster, Francisco J. Planes: Computing the shortest elementary flux modes in genome-scale metabolic networks. Bioinformatics 25(23): 3158-3165 (2009)

Francisco J. Planes, John E. Beasley: Path finding approaches and metabolic pathways. Discrete Applied Mathematics 157(10): 2244-2256 (2009)

N. A. Canakgoz, J. E. Beasley: Mixed-integer programming approaches for index tracking and enhanced indexation. European Journal of Operational Research 196(1): 384-399 (2009)

C. A. Poojari, J. E. Beasley: Improving benders decomposition using a genetic algorithm. European Journal of Operational Research 199(1): 89-97 (2009)

John E. Beasley: Multidimensional Knapsack Problems. Encyclopedia of Optimization 2009: 2402-2406

Francisco J. Planes, John E. Beasley: A critical examination of stoichiometric and path-finding approaches to metabolic pathways. Briefings in Bioinformatics 9(5): 422-436 (2008)

John E. Beasley, Francisco J. Planes: Recovering metabolic pathways via optimization. Bioinformatics 23(1): 92-98 (2007)

H. Pinol, J. E. Beasley: Scatter Search and Bionomic Algorithms for the aircraft landing problem. European Journal of Operational Research 171(2): 439-462 (2006)

J. E. Beasley: A population heuristic for constrained two-dimensional non-guillotine cutting. European Journal of Operational Research 156(3): 601-627 (2004)

A. J. Richmond, J. E. Beasley: An Iterative Construction Heuristic for the Ore Selection Problem. J. Heuristics 10(2): 153-167 (2004)

J. E. Beasley: Allocating fixed costs and resources via data envelopment analysis. European Journal of Operational Research 147(1): 198-216 (2003)

J. E. Beasley, Nigel Meade, T.-J. Chang: An evolutionary heuristic for the index tracking problem. European Journal of Operational Research 148(3): 621-643 (2003)

E. M. Cochrane, J. E. Beasley: The co-adaptive neural network approach to the Euclidean Travelling Salesman Problem. Neural Networks 16(10): 1499-1525 (2003)

T.-J. Chang, Nigel Meade, J. E. Beasley, Yazid M. Sharaiha: Heuristics for cardinality constrained portfolio optimisation. Computers & OR 27(13): 1271-1302 (2000)

John E. Beasley, Mohan Krishnamoorthy, Yazid M. Sharaiha, D. Abramson: Scheduling Aircraft Landings - The Static Case. Transportation Science 34(2): 180-197 (2000)

J. E. Beasley, B. Cao: A dynamic programming based algorithm for the crew scheduling problem. Computers & OR 25(7-8): 567-582 (1998)

P. C. Chu, J. E. Beasley: A Genetic Algorithm for the Multidimensional Knapsack Problem. J. Heuristics 4(1): 63-86 (1998)

P. C. Chu, J. E. Beasley: Constraint Handling in Genetic Algorithms: The Set Partitioning Problem. J. Heuristics 4(4): 323-357 (1998)

Abilio Lucena, J. E. Beasley: A branch and cut algorithm for the Steiner problem in graphs. Networks 31(1): 39-59 (1998)

P. C. Chu, J. E. Beasley: A genetic algorithm for the generalised assignment problem. Computers & OR 24(1): 17-23 (1997)

J. E. Beasley, F. Goffinet: A delaunay triangulation-based heuristic for the euclidean steiner problem. Networks 24(4): 215-224 (1994)

J. E. Beasley: An SST-based algorithm for the steiner problem in graphs. Networks 19(1): 1-16 (1989)

J. E. Beasley, Nicos Christofides: An algorithm for the resource constrained shortest path problem. Networks 19(4): 379-394 (1989)

J. E. Beasley: An algorithm for the steiner problem in graphs. Networks 14(1): 147-159 (1984)

Nicos Christofides, J. E. Beasley: The period routing problem. Networks 14(2): 237-256 (1984)