John Beasley
Names
| first: |
John |
| middle: |
E |
| last: |
Beasley |
Identifer
Contact
Affiliations
-
Brunel University
- http://www.brunel.ac.uk
- location: Uxbridge, UK
Research profile
author of:
- Quantitative portfolio selection: using density forecasting to find consistent portfolios (RePEc:arx:papers:1908.08442)
by N. Meade & J. E. Beasley & C. J. Adcock - A nonlinear optimisation model for constructing minimal drawdown portfolios (RePEc:arx:papers:1908.08684)
by C. A. Valle & J. E. Beasley - Subset second-order stochastic dominance for enhanced indexation with diversification enforced by sector constraints (RePEc:arx:papers:2404.16777)
by Cristiano Arbex Valle & John E Beasley & Nigel Meade - A tree search algorithm for the p-median problem (RePEc:eee:ejores:v:10:y:1982:i:2:p:196-204)
by Christofides, N. & Beasley, J. E. - Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem (RePEc:eee:ejores:v:12:y:1983:i:1:p:19-28)
by Christofides, N. & Beasley, J. E. - Allocating fixed costs and resources via data envelopment analysis (RePEc:eee:ejores:v:147:y:2003:i:1:p:198-216)
by Beasley, J. E. - An evolutionary heuristic for the index tracking problem (RePEc:eee:ejores:v:148:y:2003:i:3:p:621-643)
by Beasley, J. E. & Meade, N. & Chang, T. -J. - A population heuristic for constrained two-dimensional non-guillotine cutting (RePEc:eee:ejores:v:156:y:2004:i:3:p:601-627)
by Beasley, J. E. - Scatter Search and Bionomic Algorithms for the aircraft landing problem (RePEc:eee:ejores:v:171:y:2006:i:2:p:439-462)
by Pinol, H. & Beasley, J.E. - An algorithm for the two-dimensional assortment problem (RePEc:eee:ejores:v:19:y:1985:i:2:p:253-261)
by Beasley, J. E. - Mixed-integer programming approaches for index tracking and enhanced indexation (RePEc:eee:ejores:v:196:y:2009:i:1:p:384-399)
by Canakgoz, N.A. & Beasley, J.E. - Improving benders decomposition using a genetic algorithm (RePEc:eee:ejores:v:199:y:2009:i:1:p:89-97)
by Poojari, C.A. & Beasley, J.E. - A note on solving large p-median problems (RePEc:eee:ejores:v:21:y:1985:i:2:p:270-273)
by Beasley, J. E. - Heuristic algorithms for the cardinality constrained efficient frontier (RePEc:eee:ejores:v:213:y:2011:i:3:p:538-550)
by Woodside-Oriakhi, M. & Lucas, C. & Beasley, J.E. - A heuristic for the circle packing problem with a variety of containers (RePEc:eee:ejores:v:214:y:2011:i:3:p:512-525)
by López, C.O. & Beasley, J.E. - A formulation space search heuristic for packing unequal circles in a fixed size circular container (RePEc:eee:ejores:v:251:y:2016:i:1:p:64-73)
by López, C.O. & Beasley, J.E. - Optimally solving the joint order batching and picker routing problem (RePEc:eee:ejores:v:262:y:2017:i:3:p:817-834)
by Valle, Cristiano Arbex & Beasley, John E. & da Cunha, Alexandre Salles - Order batching using an approximation for the distance travelled by pickers (RePEc:eee:ejores:v:284:y:2020:i:2:p:460-484)
by Arbex Valle, Cristiano & Beasley, John E - Quantitative portfolio selection: Using density forecasting to find consistent portfolios (RePEc:eee:ejores:v:288:y:2021:i:3:p:1053-1067)
by Meade, N. & Beasley, J.E. & Adcock, C.J. - An algorithm for set covering problem (RePEc:eee:ejores:v:31:y:1987:i:1:p:85-93)
by Beasley, J. E. - An algorithm for solving large capacitated warehouse location problems (RePEc:eee:ejores:v:33:y:1988:i:3:p:314-325)
by Beasley, J. E. - A heuristic for Euclidean and rectilinear Steiner problems (RePEc:eee:ejores:v:58:y:1992:i:2:p:284-292)
by Beasley, J. E. - Enhancing an algorithm for set covering problems (RePEc:eee:ejores:v:58:y:1992:i:2:p:293-300)
by Beasley, J. E. & Jornsten, K. - Lagrangean heuristics for location problems (RePEc:eee:ejores:v:65:y:1993:i:3:p:383-399)
by Beasley, J. E. - A genetic algorithm for the set covering problem (RePEc:eee:ejores:v:94:y:1996:i:2:p:392-404)
by Beasley, J. E. & Chu, P. C. - A tree search algorithm for the crew scheduling problem (RePEc:eee:ejores:v:94:y:1996:i:3:p:517-526)
by Beasley, J. E. & Cao, B. - Vehicle routing with a sparse feasibility graph (RePEc:eee:ejores:v:98:y:1997:i:3:p:499-511)
by Beasley, J. E. & Christofides, N. - The use of strategic planning techniques in the United Kingdom (RePEc:eee:jomega:v:10:y:1982:i:4:p:433-440)
by Wills, LA & Beasley, JE - Route first--Cluster second methods for vehicle routing (RePEc:eee:jomega:v:11:y:1983:i:4:p:403-408)
by Beasley, JE - A heuristic algorithm for the period vehicle routing problem (RePEc:eee:jomega:v:12:y:1984:i:5:p:497-504)
by Tan, C.C.R. & Beasley, J.E. - Vehicle routing using fixed delivery areas (RePEc:eee:jomega:v:12:y:1984:i:6:p:591-600)
by Wong, KF & Beasley, JE - Strategies for corporate and business success--A survey (RePEc:eee:jomega:v:13:y:1985:i:1:p:51-58)
by Beasley, JE - Comparing university departments (RePEc:eee:jomega:v:18:y:1990:i:2:p:171-183)
by Beasley, J. E. - Corporate structure optimisation for multinational companies (RePEc:eee:jomega:v:40:y:2012:i:2:p:230-243)
by Anken, F. & Beasley, J.E. - Portfolio rebalancing with an investment horizon and transaction costs (RePEc:eee:jomega:v:41:y:2013:i:2:p:406-420)
by Woodside-Oriakhi, M. & Lucas, C. & Beasley, J.E. - Absolute return portfolios (RePEc:eee:jomega:v:45:y:2014:i:c:p:20-41)
by Valle, C.A. & Meade, N. & Beasley, J.E. - Adapting the savings algorithm for varying inter-customer travel times (RePEc:eee:jomega:v:9:y:1981:i:6:p:658-659)
by Beasley, JE - An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure (RePEc:inm:oropre:v:33:y:1985:i:1:p:49-64)
by J. E. Beasley - Scheduling Aircraft Landings—The Static Case (RePEc:inm:ortrsc:v:34:y:2000:i:2:p:180-197)
by J. E. Beasley & M. Krishnamoorthy & Y. M. Sharaiha & D. Abramson - Scheduling aircraft landings at London Heathrow using a population heuristic (RePEc:pal:jorsoc:v:52:y:2001:i:5:d:10.1057_palgrave.jors.2601129)
by J E Beasley & J Sonander & P Havelock - Placing boxes on shelves: a case study (RePEc:pal:jorsoc:v:52:y:2001:i:6:d:10.1057_palgrave.jors.2601130)
by N P Hoare & J E Beasley - Improving short-term conflict alert via tabu search (RePEc:pal:jorsoc:v:53:y:2002:i:6:d:10.1057_palgrave.jors.2601358)
by J E Beasley & H Howells & J Sonander - Displacement problem and dynamically scheduling aircraft landings (RePEc:pal:jorsoc:v:55:y:2004:i:1:d:10.1057_palgrave.jors.2601650)
by J E Beasley & M Krishnamoorthy & Y M Sharaiha & D Abramson - A tabu search algorithm for the single vehicle routing allocation problem (RePEc:pal:jorsoc:v:58:y:2007:i:4:d:10.1057_palgrave.jors.2602165)
by L Vogt & C A Poojari & J E Beasley - A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions (RePEc:pal:jorsoc:v:59:y:2008:i:7:d:10.1057_palgrave.jors.2602405)
by F Alonso & M J Alvarez & J E Beasley - Optimisation of sludge treatment and transport (RePEc:pal:jorsoc:v:62:y:2011:i:6:d:10.1057_jors.2010.44)
by G Mitchell & J E Beasley - Quantile regression for index tracking and enhanced indexation (RePEc:pal:jorsoc:v:64:y:2013:i:11:p:1676-1692)
by H Mezali & J E Beasley - Foreword (RePEc:spr:annopr:v:86:y:1999:i:0:p:0-0:10.1023/a:1018908330362)
by Y.M. Sharaiha & J.E. Beasley - An optimal algorithm for variable knockout problems (RePEc:spr:aqjoor:v:22:y:2024:i:4:d:10.1007_s10288-023-00555-3)
by J. E. Beasley - The Vehicle Routing-Allocation Problem: A unifying framework (RePEc:spr:topjnl:v:4:y:1996:i:1:p:65-86)
by J. Beasley & E. Nascimento - Detection of momentum effects using an index out-performance strategy (RePEc:taf:quantf:v:11:y:2011:i:2:p:313-326)
by N. Meade & J. E. Beasley - A lagrangian heuristic for set‐covering problems (RePEc:wly:navres:v:37:y:1990:i:1:p:151-164)
by J. E. Beasley