The two-dimensional orthogonal non-guillotine cutting problem (NGCP) appears in many industries (like wood and steel industries) and consists in cutting a rectangular master surface into a number of rectangular pieces, each with a given size and value. The pieces must be cut with their edges always parallel or orthogonal to the edges of the master surface (orthogonal cuts). The objective is to ...

background: ovarian tissue cryopreservation is an alternative strategy to preserve the fertility of women predicted to undergo premature ovarian failure. this study was designed to evaluate the expression of folliculogenesis-related genes, including factor in the germline alpha (figla), growth differentiation factor-9 (gdf-9), follicle-stimulating hormone receptor (fshr), and kit ligand after v...

Growth and yield of potato plants grown from several weight classes of whole "B" seed, unsorted "B" seed, and 56 g cut seed pieces were compared in Ohio in 1988 and 1989. Whole "B" seed classes were 8 g ranges with means of 35 g, 43 g, 51 g, and 58 g. Unsorted "B" seed was used as an experimental control. Treatment responses were inconsistent. Few significant differences were evident at bloom i...

Alice and Bob want to cut a cake and have their own opinions of what values various pieces have. In contrast to the usual problems of fair division, they want to cut it unfairly. More precisely, they want to cut it in ratio (a, b). (We can assume gcd(a,b)=1.) Let f(a, b) be the number of cuts this will take (assuming both act in their own self interest). It is known that f(a, b) ≤ dlg(a + b)e [...

Das, Basanta Kumar, Ji GanG Kim, and Ji Weon Choi, 2011. edge browning and microbial quality of fresh-cut iceberg lettuce with different sanitizers and contact times. Bulg. J. Agric. Sci., 17: 55-62 This study was conducted to evaluate the effect of different washing solutions and contact times on the cut edge browning and microbial quality of fresh-cut iceberg lettuce. samples were cut into sm...

Many classical partitioning problems in combinatorics ask for a single quantity to be maximized or minimized over a set of partitions of a combinatorial object. For instance, Max Cut asks for the largest bipartite subgraph of a graphG, while Min Bisection asks for the minimum size of a cut into two equal pieces. In judicious partitioning problems, we seek to maximize or minimize a number of qua...

In this work the concept of a trie-based complete solution archive in combination with a genetic algorithm is applied to the Reconstruction of Cross-Cut Shredded Text Documents (RCCSTD) problem. This archive is able to detect and subsequently convert duplicates into new yet unvisited solutions. Cross-cut shredded documents are documents that are cut into rectangular pieces of equal size and sha...