An Iterated Local Search method for the constrained two-dimensional non-guillotine cutting problem is presented. This problem consists in cutting pieces from a large stock rectangle to maximize the total value of pieces cut. In this problem, we take into account restrictions on the number of pieces of each size required to be cut. It can be classified as 2D-SLOPP (two dimensional single large o...

Let G = (V, E) be a graph with positive edge weights and let V’ c V. The min VI-cut prohlenl is to find a minimum weight set E’ E E such that no two nodes of V’ occur in the same component of G’ = (V, E\E’). Our main results are two new structural theorems for optimal solutions to the min V-cut problem when G is planar. The first theorem establishes for the first time a close connection between...

two factorial experiments were conducted to study the interactive effects of four levels of sucrose (0, 20, 40 and 60 g l-1), two levels of citric acid (0 and 160 mg l-1) and two levels of one of the following compounds (aluminum sulphate, 0 and 160 mg l-1 and silver nitrate, 0 and 120 g l-1) on vase life and quality attributes of lisianthus cut flowers ‘mariachi blue fonce.’ the experiments ca...

Lisianthus (Eustoma grandiflorum cv. ‘Mriachii Blue’) is one of the most important and marketable cut flowers in the world. However, a relatively limited vase life reduces its marketability. The aim of the present study was to evaluate the effects of essential oils in extending vase life of cut flowers of Lisianthus. For this purpose a factorial experiment based on a completely randomized desig...

Gerbera one of 10 important cut flowers in the world and Iran. One of the most problems is low-life after harvest and neck bending. Producers want to increase longevity of these flowers with using chemical solutions. With the aim of achieving the best chemical treatments to increase flower vase life gerbera Goodtimming, nano silver (5 mg l-1), humic acid (50 mg l-1), gibberellic acid (2.5 mg l-...

The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. We solve a strong integer linear programming formulation based on so-called jump inequalities by a Branch&Cut algorithm. As the separation subproblem of identifying currently violated jump inequalities is difficult, we...

In this paper we study the large-time behavior of perturbative classical solutions to the hard and soft potential Boltzmann equation without the angular cut-off assumption in the whole space Rx with n ≥ 3. We use the existence theory of global in time nearby Maxwellian solutions from [13,14]. It has been a longstanding open problem to determine the large time decay rates for the soft potential ...