Abstract
Recently Tracy and Chen presented a parametric DEA model (PDEA) to assess relative efficiency in the presence of a generalized form of linear weight restrictions. This paper proposes a modification to the PDEA model that avoids the need to resort to searching algorithms to estimate efficiency, and assures that the correct efficiency scores are obtained in a single stage using mathematical programming solvers. The results of this model and the results of Tracy and Chen's PDEA model are compared using the examples reported in their paper. The results confirm the superiority of the model proposed in this paper. Journal of the Operational Research Society (2010) 61, 1789-1793. doi:10.1057/jors.2009.140 Published online 16 December 2009

Abstract
The most popular weight restrictions are assurance regions (ARs), which impose ratios between weights to be within certain ranges. ARs can be categorized into two types: ARs type I (ARI) and ARs type II (ARII). ARI specify bounds on ratios between input weights or between output weights, whilst ARII specify bounds on ratios that link input to output weights. DEA models with ARI successfully maximize relative efficiency, but in the presence of ARII the DEA models may under-estimate relative efficiency or may become infeasible. In this paper we discuss the problems that can occur in the presence of ARII and propose a new nonlinear model that overcomes the limitations discussed. Also, the dual model is described, which enables the assessment of relative efficiency when trade-offs between inputs and outputs are specified. The application of the model developed is illustrated in the efficiency assessment of Portuguese. secondary schools.

Abstract
The problem of predicting the next request during a user's navigation session has been extensively studied. In this context, higher-order Markov models have been widely used to model navigation sessions and to predict the next navigation step, while prediction accuracy has been mainly evaluated with the hit and miss score. We claim that this score, although useful, is not sufficient for evaluating next link prediction models with the aim of finding a sufficient order of the model, the size of a recommendation set, and assessing the impact of unexpected events on the prediction accuracy. Herein, we make use of a variable length Markov model to compare the usefulness of three alternatives to the hit and miss score: the Mean Absolute Error, the Ignorance Score, and the Brier score. We present an extensive evaluation of the methods on real data sets and a comprehensive comparison of the scoring methods.

Abstract
It is well known that the definition of bus schedules is critical for the service reliability of public transports. Several proposals have been suggested, using data from Automatic Vehicle Location (AVL) systems, in order to enhance the reliability of public transports. In this paper we study the optimum number of schedules and the days covered by each one of them, in order to increase reliability. We use the Dynamic Time Warping distance in order to calculate the similarities between two different dimensioned irregularly spaced data sequences before the use of data clustering techniques. The application of this methodology with the K-Means for a specific bus route demonstrated that a new schedule for the weekends in non-scholar periods could be considered due to its distinct profile from the remaining days. For future work, we propose to apply this methodology to larger data sets in time and in number, corresponding to different bus routes, in order to find a consensual cluster between all the routes. ©2010 IEEE.

Abstract
In this paper, an integer programming model for two-dimensional cutting stock problems is proposed. In the problems addressed, it is intended to cut a set of small rectangular items of given sizes from a set of larger rectangular plates in such a way that the total number of used plates is minimized. The two-stage and three-stage, exact and non-exact, problems are considered. Other issues are also addressed, as the rotation of items, the length of the cuts and the value of the remaining plates. The new integer programming model can be seen as an extension of the "one-cut model" proposed by Dyckhoff for the one-dimensional cutting stock problem. In the proposed model, each decision variable is associated with cutting one item from a plate or from a part of a plate resulting from previous cuts (residual plates). Comparative computational results of the proposed model and of models from the literature are presented and discussed.

Abstract
Cutting and packing problems have been a core area of research for many decades. Irregular shape packing is one of the most recent variants to be widely researched and its history extends over 40 years. The evolution of solution approaches to this problem can be attributed to increased computer power and advances in geometric techniques as well as more sophisticated and insightful algorithm design. In this paper we will focus on the latter. Our aim is not to give a chronological account or an exhaustive review, but to draw on the literature to describe and evaluate the core approaches. Irregular packing is combinatorial and as a result solution methods are heuristic, save a few notable exceptions. We will explore different ways of representing the problem and mechanisms for moving between solutions. We will also propose where we see the future challenges for researchers in this area.