#### Filter Results:

- Full text PDF available (28)

#### Publication Year

1956

2017

- This year (1)
- Last 5 years (15)
- Last 10 years (32)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- P. C. Chu, John E. Beasley
- J. Heuristics
- 1998

- T.-J. Chang, Nigel Meade, John E. Beasley, Yazid M. Sharaiha
- Computers & OR
- 2000

In this paper we consider the problem of "nding the e$cient frontier associated with the standard mean}variance portfolio optimisation model. We extend the standard model to include cardinality constraints that limit a portfolio to have a speci"ed number of assets, and to impose limits on the proportion of the portfolio held in a given asset (if any of the… (More)

- John E. Beasley
- Operations Research
- 1985

- John E. Beasley, Mohan Krishnamoorthy, Yazid M. Sharaiha, D. Abramson
- Transportation Science
- 2000

In this paper we consider the problem of scheduling aircraft (plane) landings at an airport. This problem is one of deciding a landing time for each plane such that each plane lands within a predetermined time window and separation criteria between the landing of a plane, and the landing of all successive planes, are respected. We present a mixed-integer… (More)

- John E. Beasley, Nicos Christofides
- Networks
- 1989

- P. C. Chu, John E. Beasley
- Computers & OR
- 1997

- John E. Beasley
- J. Global Optimization
- 1996

- John E. Beasley
- European Journal of Operational Research
- 2004

In this paper we present a heuristic algorithm for the constrained two-dimensional non-guillotine cutting problem. This is the problem of cutting a number of rectangular pieces from a single large rectangle so as to maximise the value of the pieces cut. In addition the number of pieces of each type that are cut must lie within prescribed limits. Our… (More)

- John E. Beasley, Nigel Meade, T.-J. Chang
- European Journal of Operational Research
- 2003

- John E. Beasley
- Networks
- 1989

In this paper we consider the Steiner problem in graphs which is the problem of connecting together, at minimum cost, a number of vertices in an undirected graph. We present a formulation of the problem as a shortest spanning tree (SST) problem with additional constraints. By relaxing these additional constraints in a lagrangean fashion we obtain a lower… (More)