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...

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...

This paper explains how the Gibbs sampler can be used to perform Bayesian inference on GARCH models. Although the Gibbs sampler is usually based on the analytical knowledge of the full conditional posterior densities, such knowledge is not available in regression models with GARCH errors. We...

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...

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.

We show that, in any undirected graph, splitting off can be performed while preserving all cuts of value at most 3/4 times the minimum value, and this is best possible. This generalizes a classical splitting-off result of Lovasz.

Parallel machine scheduling problems concern the scheduling of "n" jobs on "m" machines to minimize some function of the job completion time. If preemption is not allowed, then most problems are not only NP-hard, but also very hard from a practical point of view. In this paper, we show that...

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.

We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to minimize the weighted sum of job completion times.