In the early 1980s, Balas and Jeroslow presented monoidal disjunctive cuts exploiting the integrality of variables. This article investigates the relation of monoidal cut strengthening to other classes of cutting planes for general two-term disjunctions. We introduce a generalization of mixed-integer rounding cuts and show equivalence to monoidal disjunctive cuts. Moreover, we demonstrate the e...

This paper tests the ‘morale’ theory of downward nominal wage rigidity. This theory relies on workers disliking nominal pay cuts: cuts should make workers less happy. We investigate this using panel data on individual employees’ pay and satisfaction. We confirm that nominal cuts do make workers less happy than if their pay had not fallen. But we find no difference in the effect on happiness of ...

Given a connected graph, in many cases it is possible to construct a structure tree that provides information about the ends of the graph or its connectivity. For example Stallings’ theorem on the structure of groups with more than one end can be proved by analyzing the action of the group on a structure tree and Tutte used a structure tree to investigate finite 2-connected graphs, that are not...

1 Minimum Cuts In this lecture we will describe an algorithm that computes the minimum cut (or simply mincut) in an undirected graph. A cut is deened as follows.

The daytime net ecosystem exchange of CO2 (NEE) was measured in an even-aged slash pine plantation in northern Florida from 1999 to 2001 using the eddy covariance technique. In August 2000, two clear-cuts were formed approximately 1 km west of the study site. A statistical approach was used to determine whether the clear-cuts induced changes in CO2 concentration, wind direction, horizontal and ...

In this paper we propose practical strategies for generating split cuts, by considering integer linear combinations of the rows of the optimal simplex tableau, and deriving the corresponding Gomory mixed-integer cuts; potentially, we can generate a huge number of cuts. A key idea is to select subsets of variables, and cut deeply in the space of these variables. We show that variables with small...

This paper describes a method to approach area-patch problems in model generalization using fuzzy set theory. The area patch problem identifies problems in generalizing areas (polygons) with the same semantics (feature code) but varying geometry and spatial distribution. Area-patch generalization can be understood as a pattern recognition problem with a variety of viable solutions, constrained ...

in this paper, a novel method for ranking of fuzzy numbers are proposed. in this method, decision maker is defined based on the center of mass at some cuts of a pair of fuzzy numbers in discreet version and center of mass on all of cuts of a pair of fuzzy numbers in continuous version. our method can rank more than two fuzzy numbers simultaneously. also, some properties of methods are described...

Intersection cuts are a family of cutting planes for pure and mixedinteger linear programs, developed in the 1970s. Most papers on them consider only cuts that come from so-called maximal lattice-point-free polyhedra. We define a completely different family of intersection cuts, called “natural”. Their key property is that they can be generated very quickly and easily from a simplex tableau. In...

Intersection cuts are generated from a polyhedral cone and a convex set S whose interior contains no feasible integer point. We generalize these cuts by replacing the cone with a more general polyhedron C. The resulting generalized intersection cuts dominate the original ones. This leads to a new cutting plane paradigm under which one generates and stores the intersection points of the extreme ...