This article aims to explain the Nested Benders algorithm for the solution of large-scale stochastic programming problems in a way that is intelligible to someone coming to it for the first time. In doing so it gives an explanation of Benders decomposition and of its application to two-stage stochastic programming problems (also known in this context as the L-shaped method), then extends this t...

We examine a decomposition approach to find good quality feasible solutions. In particular, we study a method to reduce the search-space by decomposing a problem into two partitions, where the second partition (i.e., the subproblem) contains the fixed solution of the first (i.e., the master). This type of approach is usually motivated by the presence of two sub-problems that are each more easil...

Software optimization for multicore architectures is one of the most critical challenges in today’s high-end computing. In this paper we focus on a well-known multicore platform, namely the Cell BE processor, and we address the problem of allocating and scheduling its processors, communication channels and memories, with the goal of minimizing application execution time. We have developed a com...

In order to implement the cellular manufacturing system in practice, some essential factors should be taken into account. In this paper, a new mathematical model for cellular manufacturing system considering different production factors including alternative process routings and machine reliability with stochastic arrival and service times in a dynamic environment is proposed. Also because of t...

We consider two covering variants of the network design problem. are given a set origin/destination pairs, called O/D and each such pair is covered if there exists path in from origin to destination whose length not larger than threshold. In first problem, Maximal Covering Network Design one must determine that maximizes total fulfilled demand pairs subject budget constraint on costs network. s...

A newmulti-generation of cuts algorithm is presented in this paper to improve the efficiency of Benders decomposition approach for the cases that optimality cuts are difficult to be achieved within the iterations of the algorithm. This strategy is referred to as maximum feasible subsystem (MFS) cut generation strategy. In this approach in each iteration of the Benders algorithm an additional cu...

We consider the 3-staged Strip Packing Problem, in which rectangular items have to be arranged onto a rectangular strip of fixed width, such that the items can be obtained by three stages of guillotine cuts while the required strip height is to be minimized. We propose a new logic-based Benders decomposition with two kinds of Benders cuts and compare it with a compact integer linear programming...