JE Beasley
Titolo
Citata da
Citata da
Anno
OR-Library: distributing test problems by electronic mail
JE Beasley
Journal of the operational research society 41 (11), 1069-1072, 1990
23801990
A genetic algorithm for the multidimensional knapsack problem
PC Chu, JE Beasley
Journal of heuristics 4 (1), 63-86, 1998
9951998
A genetic algorithm for the set covering problem
JE Beasley, PC Chu
European journal of operational research 94 (2), 392-404, 1996
9331996
Heuristics for cardinality constrained portfolio optimisation
TJ Chang, N Meade, JE Beasley, YM Sharaiha
Computers and Operations Research 27 (13), 1271-1302, 2000
9162000
A genetic algorithm for the generalised assignment problem
PC Chu, JE Beasley
Computers & Operations Research 24 (1), 17-23, 1997
7601997
Restricting weight flexibility in data envelopment analysis
YHB Wong, JE Beasley
Journal of the Operational Research Society 41 (9), 829-835, 1990
6121990
An exact two-dimensional non-guillotine cutting tree search procedure
JE Beasley
Operations Research 33 (1), 49-64, 1985
5751985
Determining teaching and research efficiencies
JE Beasley
Journal of the operational research society 46 (4), 441-452, 1995
5631995
Lagrangean heuristics for location problems
JE Beasley
European journal of operational research 65 (3), 383-399, 1993
5441993
Route first—cluster second methods for vehicle routing
JE Beasley
Omega 11 (4), 403-408, 1983
5361983
Scheduling aircraft landings-the static case
JE Beasley, M Krishnamoorthy, YM Sharaiha, D Abramson
Transportation science 34 (2), 180-197, 2000
5102000
The period routing problem
N Christofides, JE Beasley
Networks 14 (2), 237-256, 1984
4851984
Comparing university departments
JE Beasley
Omega 18 (2), 171-183, 1990
4641990
Technical, allocative and economic efficiencies in swine production in Hawaii: a comparison of parametric and nonparametric approaches
KR Sharma, PS Leung, HM Zaleski
Agricultural economics 20 (1), 23-35, 1999
4421999
Algorithms for unconstrained two-dimensional guillotine cutting
JE Beasley
Journal of the Operational Research Society 36 (4), 297-306, 1985
4211985
An algorithm for the resource constrained shortest path problem
JE Beasley, N Christofides
Networks 19 (4), 379-394, 1989
3961989
A lagrangian heuristic for set‐covering problems
JE Beasley
Naval Research Logistics (NRL) 37 (1), 151-164, 1990
3721990
An algorithm for set covering problem
JE Beasley
European Journal of Operational Research 31 (1), 85-93, 1987
3691987
An evolutionary heuristic for the index tracking problem
JE Beasley, N Meade, TJ Chang
European Journal of Operational Research 148 (3), 621-643, 2003
3682003
Allocating fixed costs and resources via data envelopment analysis
JE Beasley
European Journal of Operational Research 147 (1), 198-216, 2003
3472003
Il sistema al momento non puň eseguire l'operazione. Riprova piů tardi.
Articoli 1–20