Chvátal-Gomory and Gomory fractional cuts are well-known cutting planes for pure integer programming problems. Various methods for strengthening them are known, for example based on subadditive functions or disjunctive techniques. We present a new and surprisingly simple strengthening procedure, discuss its properties, and present some computational results.

A quasi-measure is a non-subadditive measure defined on only open or closed subsets of a compact Hausdorf space. We investigate the nature of irreducible partitions as defined by Aarnes and use the results to construct quasi-measures when g(X) = 1. The cohomology ring is an important tool for this investigation.

This paper is concerned with the concept of linear repetitivity in the theory of tilings. We prove a general uniform subadditive ergodic theorem for linearly repetitive tilings. This theorem unifies and extends various known (sub)additive ergodic theorems on tilings. The results of this paper can be applied in the study of both random operators and lattice gas models on tilings.

This paper considers the problem of homogenization of a class of convex HamiltonJacobi equations in spatio-temporal stationary ergodic environments. Special attention is placed on the interplay between the use of the Subadditive Ergodic Theorem and continuity estimates for the solutions that are independent of the oscillations in the equation. Moreover, an inf-sup formula for the effective Hami...

We analyse the relationship between the full additivity of the entanglement cost and its full monotonicity under local operations and classical communication. We show that the two properties are equivalent for the entanglement cost. The proof works for the regularization of any convex, subadditive, and asymptotically continuous entanglement monotone, and hence also applies to the asymptotic rel...

We study several multi-criteria undirected network design problems with node costs and lengths with all problems related to the node costs Multicommodity Buy at Bulk (MBB) problem in which we are given a graph G = (V,E), demands {dst : s, t ∈ V }, and a family {cv : v ∈ V } of subadditive cost functions. For every s, t ∈ V we seek to send dst flow units from s to t on a single path, so that

In this talk we present item pricing algorithms and mechanisms for revenue maximization in combinatorial auctions. We start by considering the unlimitedsupply combinatorial auction setting and present a simple algorithm [1] which achieves an O(k) approximation for the case of single-minded bidders who each want at most k items, improving on the O(k2) bound of Briest and Krysta [3]. We then show...