exact solution for steady two-dimensional flow of an incompressible magma is obtained. themagmatic flow is studied by considering the magma as a second grade fluid. the governing partialdifferential equations are transformed to ordinary differential equations by symmetry transformations. resultsare discussed through graphs to understand the rheology of the flowing magma

A subset W of the vertices of a graph G is a resolving set for G when for each pair of distinct vertices u,v in V (G) there exists w in W such that d(u,w)≠d(v,w). The cardinality of a minimum resolving set for G is the metric dimension of G. This concept has applications in many diverse areas including network discovery, robot navigation, image processing, combinatorial search and optimization....

One-dimensional infinite group problems have been extensively studied and have yielded strong cutting planes for mixed integer programs. Although numerical and theoretical studies suggest that group cuts can be significantly improved by considering higher-dimensional groups, there are no known facets for infinite group problems whose dimension is larger than two. In this paper, we introduce an ...

Two-dimensional bin packing problems are highly relevant combinatorial optimization problems. They find a large number of applications, for example, in the context of transportation or warehousing, and for the cutting of different materials such as glass, wood or metal. In this work we deal with the oriented two-dimensional bin packing problem under free guillotine cutting. In this specific pro...

Many numerical computations show a small difference only between the optimal value of the one-dimensional cutting stock problem and that of its corresponding linear programming relaxation. In this paper we investigate the one-dimensional cutting stock problem with respect to the modified integer round-up property (MIRUP) and present some results on subproblems having the MIRUP.

Many numerical computations show an only small difference between the optimal value of the one-dimensional cutting stock problem and that of its corresponding linear programming relaxation. In this paper we investigate the one-dimensional cutting stock problem with respect to the modified integer round-up property (MIRUP) and present some results on subproblems having the MIRUP.

Many numerical computations show a small diierence only between the optimal value of the one-dimensional cutting stock problem and that of its corresponding linear programming relaxation. In this paper we investigate the one-dimensional cutting stock problem with respect to the modiied integer roundup property (MIRUP) and present some results on subproblems having the MIRUP.

The two-dimensional cutting stock problem is the problem of cutting two-dimensional parts from a sheet such that the cutting requirements are met and no cuts overlap. This paper presents a genetic algorithm for the cutting-stock problem which handles non-convex, irregularly shaped parts and regular sheets. The objective is to maximize the utilization of the sheet for a given bill of materials. ...

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, ...

Quantitative understanding of cutting forces under hard turning conditions is important for thermal modeling, tool life estimation, chatter prediction, and tool condition monitoring purposes. Although significant research has been documented on the modeling of forces in the turning operation in general, turning of hardened materials involves several distinctive process conditions, including neg...