Details about John Beasley

Access statistics for papers by John Beasley.

Last updated 2024-12-07. Update your information in the RePEc Author Service.

Short-id: pbe674

Working Papers

2024

1. Subset second-order stochastic dominance for enhanced indexation with diversification enforced by sector constraints
   Papers, arXiv.org

2020

2. Quantitative portfolio selection: using density forecasting to find consistent portfolios
   Papers, arXiv.org
   See also Journal Article Quantitative portfolio selection: Using density forecasting to find consistent portfolios, European Journal of Operational Research, Elsevier (2021) View citations (2) (2021)

2019

3. A nonlinear optimisation model for constructing minimal drawdown portfolios
   Papers, arXiv.org

Journal Articles

2024

1. An optimal algorithm for variable knockout problems
   4OR, 2024, 22, (4), 419-433

2021

2. Quantitative portfolio selection: Using density forecasting to find consistent portfolios
   European Journal of Operational Research, 2021, 288, (3), 1053-1067 View citations (2)
   See also Working Paper Quantitative portfolio selection: using density forecasting to find consistent portfolios, Papers (2020) (2020)

2020

3. Order batching using an approximation for the distance travelled by pickers
   European Journal of Operational Research, 2020, 284, (2), 460-484 View citations (3)

2017

4. Optimally solving the joint order batching and picker routing problem
   European Journal of Operational Research, 2017, 262, (3), 817-834 View citations (20)

2016

5. A formulation space search heuristic for packing unequal circles in a fixed size circular container
   European Journal of Operational Research, 2016, 251, (1), 64-73 View citations (5)

2014

6. Absolute return portfolios
   Omega, 2014, 45, (C), 20-41 View citations (13)

2013

7. Portfolio rebalancing with an investment horizon and transaction costs
   Omega, 2013, 41, (2), 406-420 View citations (27)
8. Quantile regression for index tracking and enhanced indexation
   Journal of the Operational Research Society, 2013, 64, (11), 1676-1692 View citations (17)

2012

9. Corporate structure optimisation for multinational companies
   Omega, 2012, 40, (2), 230-243 View citations (4)

2011

10. A heuristic for the circle packing problem with a variety of containers
    European Journal of Operational Research, 2011, 214, (3), 512-525 View citations (13)
11. Detection of momentum effects using an index out-performance strategy
    Quantitative Finance, 2011, 11, (2), 313-326 View citations (11)
12. Heuristic algorithms for the cardinality constrained efficient frontier
    European Journal of Operational Research, 2011, 213, (3), 538-550 View citations (46)
13. Optimisation of sludge treatment and transport
    Journal of the Operational Research Society, 2011, 62, (6), 939-948 View citations (1)

2009

14. Improving benders decomposition using a genetic algorithm
    European Journal of Operational Research, 2009, 199, (1), 89-97 View citations (23)
15. Mixed-integer programming approaches for index tracking and enhanced indexation
    European Journal of Operational Research, 2009, 196, (1), 384-399 View citations (70)

2008

16. A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions
    Journal of the Operational Research Society, 2008, 59, (7), 963-976 View citations (15)

2007

17. A tabu search algorithm for the single vehicle routing allocation problem
    Journal of the Operational Research Society, 2007, 58, (4), 467-480 View citations (5)

2006

18. Scatter Search and Bionomic Algorithms for the aircraft landing problem
    European Journal of Operational Research, 2006, 171, (2), 439-462 View citations (17)

2004

19. A population heuristic for constrained two-dimensional non-guillotine cutting
    European Journal of Operational Research, 2004, 156, (3), 601-627 View citations (21)
20. Displacement problem and dynamically scheduling aircraft landings
    Journal of the Operational Research Society, 2004, 55, (1), 54-64 View citations (15)

2003

21. Allocating fixed costs and resources via data envelopment analysis
    European Journal of Operational Research, 2003, 147, (1), 198-216 View citations (93)
22. An evolutionary heuristic for the index tracking problem
    European Journal of Operational Research, 2003, 148, (3), 621-643 View citations (91)

2002

23. Improving short-term conflict alert via tabu search
    Journal of the Operational Research Society, 2002, 53, (6), 593-602

2001

24. Placing boxes on shelves: a case study
    Journal of the Operational Research Society, 2001, 52, (6), 605-614 View citations (3)
25. Scheduling aircraft landings at London Heathrow using a population heuristic
    Journal of the Operational Research Society, 2001, 52, (5), 483-493 View citations (23)

2000

26. Scheduling Aircraft Landings—The Static Case
    Transportation Science, 2000, 34, (2), 180-197 View citations (35)

1999

27. Foreword
    Annals of Operations Research, 1999, 86, 0-0 View citations (4)

1997

28. Vehicle routing with a sparse feasibility graph
    European Journal of Operational Research, 1997, 98, (3), 499-511 View citations (4)

1996

29. A genetic algorithm for the set covering problem
    European Journal of Operational Research, 1996, 94, (2), 392-404 View citations (75)
30. A tree search algorithm for the crew scheduling problem
    European Journal of Operational Research, 1996, 94, (3), 517-526 View citations (17)
31. The Vehicle Routing-Allocation Problem: A unifying framework
    TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, 1996, 4, (1), 65-86 View citations (16)

1993

32. Lagrangean heuristics for location problems
    European Journal of Operational Research, 1993, 65, (3), 383-399 View citations (75)

1992

33. A heuristic for Euclidean and rectilinear Steiner problems
    European Journal of Operational Research, 1992, 58, (2), 284-292 View citations (4)
34. Enhancing an algorithm for set covering problems
    European Journal of Operational Research, 1992, 58, (2), 293-300 View citations (24)

1990

35. A lagrangian heuristic for set‐covering problems
    Naval Research Logistics (NRL), 1990, 37, (1), 151-164 View citations (15)
36. Comparing university departments
    Omega, 1990, 18, (2), 171-183 View citations (87)

1988

37. An algorithm for solving large capacitated warehouse location problems
    European Journal of Operational Research, 1988, 33, (3), 314-325 View citations (21)

1987

38. An algorithm for set covering problem
    European Journal of Operational Research, 1987, 31, (1), 85-93 View citations (35)

1985

39. A note on solving large p-median problems
    European Journal of Operational Research, 1985, 21, (2), 270-273 View citations (20)
40. An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
    Operations Research, 1985, 33, (1), 49-64 View citations (86)
41. An algorithm for the two-dimensional assortment problem
    European Journal of Operational Research, 1985, 19, (2), 253-261 View citations (6)
42. Strategies for corporate and business success--A survey
    Omega, 1985, 13, (1), 51-58

1984

43. A heuristic algorithm for the period vehicle routing problem
    Omega, 1984, 12, (5), 497-504 View citations (56)
44. Vehicle routing using fixed delivery areas
    Omega, 1984, 12, (6), 591-600 View citations (9)

1983

45. Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
    European Journal of Operational Research, 1983, 12, (1), 19-28 View citations (20)
46. Route first--Cluster second methods for vehicle routing
    Omega, 1983, 11, (4), 403-408 View citations (35)

1982

47. A tree search algorithm for the p-median problem
    European Journal of Operational Research, 1982, 10, (2), 196-204 View citations (11)
48. The use of strategic planning techniques in the United Kingdom
    Omega, 1982, 10, (4), 433-440

1981

49. Adapting the savings algorithm for varying inter-customer travel times
    Omega, 1981, 9, (6), 658-659 View citations (7)