For a given finite poset (P,-<), we construct strict completions of P which are models of all finite lattices L such that the set of join-irreducible elements of L is isomorphic to P.

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

I summarize and extend my results establishing that limited arbitrage is necessary and sufficient for the existence of a competitive equilibrium and for the compactness of the Pareto frontier.