J. E. Beasley - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 33 from 33

2019

Packing a fixed number of identical circles in a circular container with circular prohibited areasClaudia O. López, J. E. Beasley. ol, 13(7):1449-1468, 2019. [doi]

2018

Packing unequal rectangles and squares in a fixed size circular container using formulation space searchClaudia O. López, J. E. Beasley. cor, 94:106-117, 2018. [doi]

2016

A formulation space search heuristic for packing unequal circles in a fixed size circular containerClaudia O. López, J. E. Beasley. eor, 251(1):64-73, 2016. [doi]

2014

A note on solving MINLP's using formulation space searchC. O. López, J. E. Beasley. ol, 8(3):1167-1182, 2014. [doi]

Index tracking with fixed and variable transaction costsH. Mezali, J. E. Beasley. ol, 8(1):61-80, 2014. [doi]

2013

Metaheuristics with disposal facility positioning for the waste collection VRP with time windowsA. M. Benjamin, J. E. Beasley. ol, 7(7):1433-1449, 2013. [doi]

Packing unequal circles using formulation space searchC. O. López, J. E. Beasley. cor, 40(5):1276-1288, 2013. [doi]

Quantile regression for index tracking and enhanced indexationH. Mezali, J. E. Beasley. jors, 64(11):1676-1692, 2013. [doi]

2011

Optimisation of sludge treatment and transportG. Mitchell, J. E. Beasley. jors, 62(6):939-948, 2011. [doi]

Heuristic algorithms for the cardinality constrained efficient frontierM. Woodside-Oriakhi, C. Lucas, J. E. Beasley. eor, 213(3):538-550, 2011. [doi]

2010

Metaheuristics for the waste collection vehicle routing problem with time windows, driver rest period and multiple disposal facilitiesA. M. Benjamin, J. E. Beasley. cor, 37(12):2270-2280, 2010. [doi]

2009

Mixed-integer programming approaches for index tracking and enhanced indexationN. A. Canakgoz, J. E. Beasley. eor, 196(1):384-399, 2009. [doi]

Improving benders decomposition using a genetic algorithmC. A. Poojari, J. E. Beasley. eor, 199(1):89-97, 2009. [doi]

2008

A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictionsF. Alonso, M. J. Alvarez, J. E. Beasley. jors, 59(7):963-976, 2008. [doi]

2006

Scatter Search and Bionomic Algorithms for the aircraft landing problemH. Pinol, J. E. Beasley. eor, 171(2):439-462, 2006. [doi]

2004

A population heuristic for constrained two-dimensional non-guillotine cuttingJ. E. Beasley. eor, 156(3):601-627, 2004. [doi]

An Iterative Construction Heuristic for the Ore Selection ProblemA. J. Richmond, J. E. Beasley. heuristics, 10(2):153-167, 2004. [doi]

2003

An evolutionary heuristic for the index tracking problemJ. E. Beasley, Nigel Meade, T.-J. Chang. eor, 148(3):621-643, 2003. [doi]

Allocating fixed costs and resources via data envelopment analysisJ. E. Beasley. eor, 147(1):198-216, 2003. [doi]

The co-adaptive neural network approach to the Euclidean Travelling Salesman ProblemE. M. Cochrane, J. E. Beasley. NN, 16(10):1499-1525, 2003. [doi]

2000

Heuristics for cardinality constrained portfolio optimisationT.-J. Chang, Nigel Meade, J. E. Beasley, Yazid M. Sharaiha. cor, 27(13):1271-1302, 2000. [doi]

1998

A dynamic programming based algorithm for the crew scheduling problemJ. E. Beasley, B. Cao. cor, 25(7-8):567-582, 1998. [doi]

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

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

A branch and cut algorithm for the Steiner problem in graphsAbilio Lucena, J. E. Beasley. networks, 31(1):39-59, 1998. [doi]

1997

A genetic algorithm for the generalised assignment problemP. C. Chu, J. E. Beasley. cor, 24(1):17-23, 1997. [doi]

1996

Obtaining test problems via InternetJ. E. Beasley. jgo, 8(4):429-433, 1996. [doi]

1994

A delaunay triangulation-based heuristic for the euclidean steiner problemJ. E. Beasley, F. Goffinet. networks, 24(4):215-224, 1994. [doi]

1989

An algorithm for the resource constrained shortest path problemJ. E. Beasley, Nicos Christofides. networks, 19(4):379-394, 1989. [doi]

An SST-based algorithm for the steiner problem in graphsJ. E. Beasley. networks, 19(1):1-16, 1989. [doi]

1985

An Exact Two-Dimensional Non-Guillotine Cutting Tree Search ProcedureJ. E. Beasley. ior, 33(1):49-64, 1985. [doi]

1984

An algorithm for the steiner problem in graphsJ. E. Beasley. networks, 14(1):147-159, 1984. [doi]

The period routing problemNicos Christofides, J. E. Beasley. networks, 14(2):237-256, 1984. [doi]

Sign in or sign up to see more results.

runs on WebDSL