We study the classical single machine scheduling problem but with uncertainty. A robust optimization model is presented, and an effective deep cut is derived. Numerical experiments show effectiveness of the derived cut.

We present an algorithm for a magic trick. Given a polygon with holesP , our algorithm determines a folding of a rectangular sheet of paper such that a single straight cut suffices to cut out P .

Purpose: to study the single-cut layout of emitters in feed zone woody plants for compliance with requirements perennial orchards. Materials and methods. In course work, an analytical schemes placing gardens planting 4.0 × 1.5 was carried out; 2.0; 5.0 3.0 m under conditions light heavy loamy, clayey soils. The assessment conformity arrangement out according criteria “the proportion moistening ...

Abstract We study the effect of electoral system (single-ballot vs runoff) on quality politicians, measured by average educational attainment, at local level in Italy over period 1994–2017. By exploiting discontinuous voting rule shift nearby 15,000 population cut-off, we have implemented a RDD and found that change scheme leads to an overall downward variation attainment politicians about 2 % ...

The MAXIMUM CUT problem (MAX-CUT) is one of the simplest graph partitioning problems to conceptualize, and yet it is one of the most difficult combinatorial optimization problems to solve. The objective of MAX-CUT is to partition the set of vertices of a graph into two subsets, such that the sum of the weights of the edges having one endpoint in each of the subsets is maximum. This problem is k...

The ham-sandwich theorem states that, given d ≥ 2 measures in R, it is possible to divide all of them in half with a single (d − 1)-dimensional hyperplane. We study an orthogonal version of the ham-sandwich theorem and define an orthogonal cut using at most d hyperplanes orthogonal to coordinate axes. For example, a hyperplane orthogonal to a coordinate axis and the boundary of an orthant are o...