determining the optimal pattern for growing crops in accordance with the availability of the resources and risk factors as well as the uncertainty of agriculture sector would help the farmers, managers and economic planners in selecting the type of the product and the level of cultivation. fuzzy programming model with interval programming approach is used in this study to determine the optimal ...

Gomory mixed-integer (GMI) cuts are among the most effective cutting planes for general mixed-integer programs (MIP). They are traditionally generated from an optimal basis of a linear programming (LP) relaxation of a MIP. In this paper we propose a heuristic to generate useful GMI cuts from additional bases of the initial LP relaxation. The cuts we generate have rank one, i.e., they do not use...

An optimal bsp for a set S of disjoint line segments in the plane is a bsp for S that produces the minimum number of cuts. We study optimal bsps for three classes of bsps, which differ in the splitting lines that can be used when partitioning a set of fragments in the recursive partitioning process: free bsps can use any splitting line, restricted bsps can only use splitting lines through pairs...

An optimal bsp for a set S of disjoint line segments in the plane is a bsp for S that produces the minimum number of cuts. We study optimal bsps for three classes of bsps, which differ in the splitting lines that can be used when partitioning a set of fragments in the recursive partitioning process: free bsps can use any splitting line, restricted bsps can only use splitting lines through pairs...

Given a convex polyhedron P of n vertices inside a sphere Q, we give an O(n)-time algorithm that cuts P out of Q by using guillotine cuts and has cutting cost O(log n) times the optimal.

Two simple approximation algorithms for the minimum k-cut problem are presented. Each algorithm finds a k cut having weight within a factor of (2 2/k) of the optimal. One algorithm is particularly efficient-it requires a total of only n maximum flow computations for finding a set of near-optimal k cuts, one for each value of k between 2 and n.

Given an undirected graph G = (V; E) and three speciied terminal nodes t1; t2; t3, a 3-cut is a subset A of E such that no two terminals are in the same component of GnA. If a non-negative edge weight ce is speciied for each e 2 E, the optimal 3-cut problem is to nd a 3-cut of minimum total weight. This problem is NP-hard, and in fact, is max-SNP-hard. An approximation algorithm having performa...

We study the space complexity of sketching cuts and Laplacian quadratic forms of graphs. We show that any data structure which approximately stores the sizes of all cuts in an undirected graph on n vertices up to a 1 + ǫ error must use Ω(n logn/ǫ) bits of space in the worst case, improving the Ω(n/ǫ) bound of [ACK16] and matching the best known upper bound achieved by spectral sparsifiers [BSS1...