Abstract
In this article, we review published studies that consider the solution of the one-dimensional cutting stock problem (1DCSP) with the possibility of using leftovers to meet future demands, if long enough. The one-dimensional cutting stock problem with usable leftovers (1DCSPUL) is a problem frequently encountered in practical settings but often, it is not dealt with in an explicit manner. For each work reviewed, we present the application, the mathematical model if one is proposed and comments on the computational results obtained. The approaches are organized into three classes: heuristics, item-oriented, or cutting pattern-oriented. © 2014 Elsevier B.V. All rights reserved.

Abstract
As a combination of different methodologies or parts of methodologies, Multimethodology is becoming more frequent in OR practice. This paper contributes with a new proposal and a new field of application: the employment of Multimethodology in problem solving with Metaheuristics (Mh). A convenient selection of soft and hard methods will be considered, from Soft OR, Creativity and Metaheuristics, such as Strategic Choice Approach, SWOT Analysis and Divergent and Convergent thinking. Formulating the 'right' optimisation problem, choosing a method based on Mh and accomplishing an effective implementation is an imprecise decision-making process, which may require skills and ideas that are beyond the ordinary boundaries of Mh practice. The relevance and success of Mh have been well-known for decades, but some open questions concerning choice and implementation strategies, for instance, still remain. If these questions are not adequately answered, they may lose credibility in the long term. The quality of solutions and computational times are not the only criteria used to analyse Mh, nor are they the most important. Very often, the effectiveness of an approach has to be evaluated from the perspective of modelling and practical problem solving. This paper investigates the advantages of Multimethodology and, furthermore, it sketches a framework for a coherent and comprehensive comparison of Mh and recommends a dynamic guiding tool for their implementation.

Abstract
Este trabalho dá a conhecer um novo problema, Problema Capacitado de Rotas em Arcos Misto, com Múltiplos Aterros Limitados. Baseado na situação de recolha/transporte de Resíduos Sólidos Urbanos no concelho de Monção, são apresentadas características que, não sendo únicas em Portugal, nunca foram mencionadas na literatura. Diferencia-se pela existência de diversos pontos de deposição que, especialmente devido às reduzidas dimensões, apresentam restrições relacionadas com o número de visitas recebidas por dia. Um novo modelo de otimização, baseado na formulação do Mixed Ca- pacitated Arc Routing Problem é apresentado. São incluídos resultados computacionais provenientes de instâncias adaptadas da literatura e do problema real descrito.

Abstract
In this paper, we present an integer linear programming model for the vehicle routing problem that considers real-world three-dimensional (3D) loading constraints. In this problem, a set of customers make requests of goods that are wrapped up in boxes, and the objective is to find minimum cost delivery routes for a set of identical vehicles that, departing from a depot, visit all customers only once and return to the depot. Apart from the usual 3D container loading constraints that ensure the boxes are packed completely inside the vehicles and the boxes do not overlap each other in each vehicle, the problem also takes into account constraints related to the vertical stability of the cargo, multidrop situations, and load-bearing strength of the boxes (including fragility). Computational tests with the proposed model were performed using an optimization solver embedded into a modeling language. The results validate the model and show that it is only able to handle problems of a moderate size. However, this model will be useful to motivate other researchers to explore approximate solution approaches to solve this problem, such as decomposition methods, relaxation methods, heuristics, among others, as well as to treat other variants of the problem, such as when time windows or a heterogeneous fleet are present, among others.

Abstract
The nesting problem, also known as irregular packing problem, belongs to the generic class of cutting and packing (C&P) problems. It differs from other 2-D C&P problems in the irregular shape of the pieces. This paper proposes a new mixed-integer model in which binary decision variables are associated with each discrete point of the board (a dot) and with each piece type. It is much more flexible than previously proposed formulations and solves to optimality larger instances of the nesting problem, at the cost of having its precision dependent on board discretization. To date no results have been published concerning optimal solutions for nesting problems with more than 7 pieces. We ran computational experiments on 45 problem instances with the new model, solving to optimality 34 instances with a total number of pieces ranging from 16 to 56, depending on the number of piece types, grid resolution and the size of the board. A strong advantage of the model is its insensitivity to piece and board geometry, making it easy to extend to more complex problems such as non-convex boards, possibly with defects. Additionally, the number of binary variables does not depend on the total number of pieces but on the number of piece types, making the model particularly suitable for problems with few piece types. The discrete nature of the model requires a trade-off between grid resolution and problem size, as the number of binary variables grows with the square of the selected grid resolution and with board size.

Abstract
Operations Research/Management Science (OR/MS) can be described as the discipline of applying advanced analytical methods to help making better decisions and has been around in the agricultural and forestry management sectors since the fifties, approaching decision problems that range from more strategic sectorlevel planning to farm operation issues and integrated supply chain management. In this paper insights are given on the use of OR/MS in agriculture, illustrating them with cases drawn from the literature on this topic while keeping the descriptions accessible to uninitiated readers. The presence of OR/MS in Agriculture and Forest Management applications is already extensive but the potential for development is huge in times where resources are becoming increasingly scarce and more has to be done with less, in a sustainable way.