Granot and Hammer (Granot, F., P. L. Hammer. 1971. On the use of boolean functions in 0-1 programming. Operations Research, Statistics and Economic Mimeograph Series No. 70, Technion (August 1970). (Published in Methods of Oper. Res. 12 154-184); Granot, F., P. L. Hammer. 1975. On the role of...

We develop in this paper two types of heuristic methods for solving the positive 0-1 polynomial programming (PP) problem of finding a 0-1 vector x that maximizes c^Tx subject to f(x) \le b where c, b \ge 0 and f is an m-vector of polynomials with non-negative coefficients. The various heuristics...

We introduce the concept of a characterization set for the nucleolus of a cooperative game and develop sufficient conditions for a collection of coalitions to form a characterization set thereof. Further, we formalize Kopelowitz's method for computing the nucleolus through the notion of a...

We introduce and analyze a Hotelling like game wherein players can locate in a city, at a fixed cost, according to an exogenously given order. Demand intensity is assumed to be strictly decreasing in distance and players locate in the city as long as it is profitable for them to do so. For a...