JE Beasley
TitleCited byYear
OR-Library: distributing test problems by electronic mail
JE Beasley
Journal of the operational research society 41 (11), 1069-1072, 1990
23741990
A genetic algorithm for the multidimensional knapsack problem
PC Chu, JE Beasley
Journal of heuristics 4 (1), 63-86, 1998
8881998
A genetic algorithm for the set covering problem
JE Beasley, PC Chu
European journal of operational research 94 (2), 392-404, 1996
8391996
Heuristics for cardinality constrained portfolio optimisation
TJ Chang, N Meade, JE Beasley, YM Sharaiha
Computers and Operations Research 27 (13), 1271-1302, 2000
7652000
A genetic algorithm for the generalised assignment problem
PC Chu, JE Beasley
Computers & Operations Research 24 (1), 17-23, 1997
6751997
Restricting weight flexibility in data envelopment analysis
YHB Wong, JE Beasley
Journal of the Operational Research Society 41 (9), 829-835, 1990
5771990
An exact two-dimensional non-guillotine cutting tree search procedure
JE Beasley
Operations Research 33 (1), 49-64, 1985
5381985
Determining teaching and research efficiencies
JE Beasley
Journal of the operational research society 46 (4), 441-452, 1995
5191995
Lagrangean heuristics for location problems
JE Beasley
European Journal of Operational Research 65 (3), 383-399, 1993
5131993
Route first—cluster second methods for vehicle routing
JE Beasley
Omega 11 (4), 403-408, 1983
4531983
Scheduling aircraft landings-the static case
JE Beasley, M Krishnamoorthy, YM Sharaiha, D Abramson
Transportation science 34 (2), 180-197, 2000
4472000
Comparing university departments
JE Beasley
Omega 18 (2), 171-183, 1990
4391990
The period routing problem
N Christofides, JE Beasley
Networks 14 (2), 237-256, 1984
3991984
Algorithms for unconstrained two-dimensional guillotine cutting
JE Beasley
Journal of the Operational Research Society 36 (4), 297-306, 1985
3941985
Lagrangian relaxation
JE Beasley
Modern heuristic techniques for combinatorial problems, 243-303, 1993
350*1993
An algorithm for the resource constrained shortest path problem
JE Beasley, N Christofides
Networks 19 (4), 379-394, 1989
3491989
A lagrangian heuristic for set‐covering problems
JE Beasley
Naval Research Logistics (NRL) 37 (1), 151-164, 1990
3311990
An algorithm for set covering problem
JE Beasley
European Journal of Operational Research 31 (1), 85-93, 1987
3151987
An evolutionary heuristic for the index tracking problem
JE Beasley, N Meade, TJ Chang
European Journal of Operational Research 148 (3), 621-643, 2003
3102003
Allocating fixed costs and resources via data envelopment analysis
JE Beasley
European Journal of Operational Research 147 (1), 198-216, 2003
2822003
The system can't perform the operation now. Try again later.
Articles 1–20