If we can evaluate a curve by means of a corner cutting algorithm, we call the corresponding system of functions a corner cutting system. We prove that corner cutting systems are always monotonicity preserving. We obtain weak sufficient conditions for corner cutting systems. Optimal stability properties and properties concerning the supports of the basis functions of corner cutting systems are ...

A linear integer minimization problem (IP) has the modified integer round-up property (MIRUP) if the optimal value of any instance of IP is not greater than the optimal value of the corresponding LP relaxation problem rounded up plus one. The aim of this paper is to investigate numerically whether the MIRUP holds for the one-dimensional cutting stock problem. The computational experiments carri...

In this study, a dynamic programming approach to deal with the unconstrained twodimensional non-guillotine cutting problem is presented. The method extends the recently introduced recursive partitioning approach for the manufacturer’s pallet loading problem. The approach involves two phases and uses bounds based on unconstrained two-staged and non-staged guillotine cutting. Since a counterexamp...

A linear integer minimization problem (IP) has the modiied integer roundup property (MIRUP) if the optimal value of any instance of IP is not greater than the optimal value of the corresponding LP relaxation problem rounded up plus one. The aim of this paper is to investigate numerically whether the MIRUP holds for the one-dimensional cutting stock problem. The computational experiments carried...

Test generation complexity varies exponentially as the depth of cycles in the S-graph of the circuit. We map the hard-to-reach states obtained from a sequential test generator onto the cycles in the S-graph of the circuit. We then proceed to rank the cycles in terms of the testability gain that would result if the cycle were broken. The primary objective is not to cut all the cycles but to cut ...

A linear utility model is introduced for optimal selection when several subpopulations of applicants are to be distinguished. Using this model, procedures are described for obtaining optimal cutting scores in subpopulations in quota-free as well as quota-restricted selection situations. The cutting scores are optimal in the sense that they maximize the overall expected utility of the selection ...

We consider the classic cake cutting problem where one allocates a divisible to n participating agents. Among all valid divisions, fairness and efficiency (a.k.a. ~social welfare) are most critical criteria satisfy optimize, respectively. study computational complexity of computing an optimal division given conditions that allocation satisfies proportional assigns each agent connected piece. Fo...

This study modelled the potential biodiversity benefits and the opportunity costs of a patch-clear-cutting strategy over a clear-cutting strategy for Pinus radiata in New Zealand. Patch-clear cutting is a special case of clear cutting involving the removal of all the trees from strips or patches within a stand, leaving the remainder uncut or clear cutting a series of strips or patches. A forest...

This research work describes an intelligent and modular architecture for controlling the milling process. For this purpose, it is taking into account the admissible input cutting parameters given by the stability lobes and restrictions of the system, calculating the quasi-optimal cutting parameters. The quasi-optimal cutting parameters are obtained considering a cost function with multi-objecti...