Seguir
JE Beasley
Título
Citado por
Citado por
Año
OR-Library: distributing test problems by electronic mail
JE Beasley
Journal of the operational research society 41 (11), 1069-1072, 1990
28521990
A genetic algorithm for the multidimensional knapsack problem
PC Chu, JE Beasley
Journal of heuristics 4, 63-86, 1998
12111998
Heuristics for cardinality constrained portfolio optimisation
TJ Chang, N Meade, JE Beasley, YM Sharaiha
Computers and Operations Research 27 (13), 1271-1302, 2000
11802000
A genetic algorithm for the set covering problem
JE Beasley, PC Chu
European journal of operational research 94 (2), 392-404, 1996
10771996
A genetic algorithm for the generalised assignment problem
PC Chu, JE Beasley
Computers & Operations Research 24 (1), 17-23, 1997
9311997
Restricting weight flexibility in data envelopment analysis
YHB Wong, JE Beasley
Journal of the Operational Research Society 41, 829-835, 1990
7461990
Determining teaching and research efficiencies
JE Beasley
Journal of the operational research society 46, 441-452, 1995
6661995
Route first—cluster second methods for vehicle routing
JE Beasley
Omega 11 (4), 403-408, 1983
6621983
An exact two-dimensional non-guillotine cutting tree search procedure
JE Beasley
Operations Research 33 (1), 49-64, 1985
6601985
Scheduling aircraft landings-the static case
JE Beasley, M Krishnamoorthy, YM Sharaiha, D Abramson
Transportation science 34 (2), 180-197, 2000
6372000
Lagrangean heuristics for location problems
JE Beasley
European journal of operational research 65 (3), 383-399, 1993
5991993
The period routing problem
N Christofides, JE Beasley
Networks 14 (2), 237-256, 1984
5661984
Comparing university departments
JE Beasley
Omega 18 (2), 171-183, 1990
5481990
Algorithms for unconstrained two-dimensional guillotine cutting
JE Beasley
Journal of the Operational Research Society 36 (4), 297-306, 1985
4841985
An evolutionary heuristic for the index tracking problem
JE Beasley, N Meade, TJ Chang
European Journal of Operational Research 148 (3), 621-643, 2003
4792003
An algorithm for the resource constrained shortest path problem
JE Beasley, N Christofides
Networks 19 (4), 379-394, 1989
4731989
Allocating fixed costs and resources via data envelopment analysis
JE Beasley
European Journal of Operational Research 147 (1), 198-216, 2003
4462003
An algorithm for set covering problem
JE Beasley
European Journal of Operational Research 31 (1), 85-93, 1987
4441987
A lagrangian heuristic for set‐covering problems
JE Beasley
Naval Research Logistics (NRL) 37 (1), 151-164, 1990
4141990
Or-library
JE Beasley
http://people. brunel. ac. uk/~ mastjjb/jeb/info. html, 2010
3782010
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20