In this paper we consider the problem of finding the efficient frontier associated with the
standard mean–variance portfolio optimisation model. We extend the standard model to include …

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 …

Binary Digital Image Processing is aimed at faculty, postgraduate students and industry
specialists. It is both a text reference and a textbook that reviews and analyses the research …

In this paper we define a generic decision problem — the displacement problem. The
displacement problem arises when we have to make a sequence of decisions and each new …

… The third author, Yazid Sharaiha, undertook this research while he visited CSIRO
Mathematical and Information Sciences (CMIS), Australia. He wishes to acknowledge the partial …

The Capacitated Shortest Spanning Tree Problem consists of determining a shortest spanning
tree in a vertex weighted graph such that the weight of every subtree linked to the root by …

(All work in this paper is based on research conducted by the two authors working for Morgan
Stanley and the findings have appeared in the Morgan Stanley Quantitative and Derivative …

Breast cancer is the most common malignancy in women in the UK with well-defined algorithms
of management in place in the western world. Squamous cell carcinoma of the breast is …

We present a novel graph-theoretic approach to the Distance Transformation (DT) problem.
The binary digital image is considered as a graph and the DT problem reduces to a shortest …

This paper studies the mapping between continuous and discrete distances. The continuous
distance considered is the widely used Euclidean distance, whereas we consider as the …