In the first part of this paper we prove that the global quadratic optimization problem over a simplex can be solved with a constant relative accuracy. In the second part we consider some natural extensions of the result.

In this paper, I first prove an integral representation theorem: Every quasi-integral on a Stone lattice can be represented by a unique upper-continuous capacity. I then apply this representation theorem to study the topological structure of the space of all upper-continuous capacities on a...

A profit maximising auctioneer can provide a public good to a group of agents. Each group member has a private value for the good being provided to the group. We investigate an auction mechanism where the auctioneer provides the good to the group, only if the sum of their bids exceeds a reserve...

This paper presents a combinatorial polynomial-time algorithm for minimizing submodular set functions. The algorithm employs a scaling scheme that uses a flow in the complete directed graph on the underlying set with each arc capacity equal to the scaled parameter.

A profit-maximizing auctioneer can provide a public good to at most one of a number of groups of agents. The groups may have non-empty intersections. Each group member has a private value for the good being provided to the group. We investigate an auction mechanism where the auctioneer provides...

In this paper we decribe a hybrid strategy for solving combinatorial optimisation problemms, obtained by coupling a local search method to an evolutionary algorithm, and we provide an application to the Manhattan newspaper problem. The local search method has been devised specifically for this...

A branch-and-cut mixed integer programming system, called bc-opt, is described, incorporating most of the valid inequalities that have been used or suggested for such systems, namely lifted 0-1 knpsack inequalities, 0-1 gub knapsack and integer knapsack inequalities, flow-cover and continuous...

Mixture sets were introduced by Herstein and Milnor (1953) into decision theory, where they are still widely used. This note clarifies the formal connection between mixture sets and convex sets. The results suggest that the former concept might be unnecessary for decision- theoretic purposes.

The cut polyhedron cut(G) of an undirected graph G = (V,E) is the dominant of the convex hull of all of its nonempty edge cutsets. After examining various compact extended formulations for cut(G), we study some of its polyhedral properties. In particular, we characterize all of the facets...

The appearance of the normal density remained unexplained in Mertens and Zamir's proof: it appeared there as the solution of a differential equation. Our proof however justifies this normal density as a consequence of a generalisation of the CLT discussed in the second part of this paper.