S mall-gauge sutureless pars plana vitrectomy reduces postoperative inflammation at the sclerotomy sites in comparison with conventional 20-gauge sutured pars plana vitrectomy, thus decreasing patient discomfort postoperatively and hastening recovery.1-5 Despite the clinical advantages of smaller diameter vitrectomy systems, they pose significant challenges in vitreous removal as they decrease ...

Given a set of rectangular pieces and a rectangular container, the two-dimensional knapsack problem (2D-KP) consists of orthogonally packing a subset of the pieces within the container such that the sum of the values of the packed pieces is maximized. If the value of a piece is given by its area the objective is to maximize the covered area of the container. A genetic algorithm (GA) is proposed...

Electrical Discharge Machining (EDM) process is one of the most widely used methods for machining. This method is used to form parts that conduct electricity. This method of machining has used for hard materials and therefore selects the correct values of parameters which are so effective on the quality machining of parts. Reaching to optimum condition of the DIN1.2080 alloy (D3) machining is v...

Electrical Discharge Machining (EDM) process is one of the most widely used methods for machining. This method is used to form parts that conduct electricity. This method of machining has used for hard materials and therefore selects the correct values of parameters which are so effective on the quality machining of parts. Reaching to optimum condition of the DIN1.2080 alloy (D3) machining is v...

I N T R O D U C T I O N In a number of industries, such as paper and film, there is an important class of problems OVER THE past 20 years, a substantial amount that falls in between the well known one and of work has been done on one and two-dimentwo-dimensional problems. These are referred sional cutting stock problems. A number of to here as two-stage cutting stock problems early authors [1, ...

T two-dimensional bin-packing problem is the problem of orthogonally packing a given set of rectangles into a minimum number of two-dimensional rectangular bins. The problem is -hard and very difficult to solve in practice as no good mixed integer programming (MIP) formulation has been found for the packing problem. We propose an algorithm based on the well-known Dantzig-Wolfe decomposition whe...