We consider combinatorial optimization problems with uncertain objective functions. In the min-max-min robust optimization approach, a fixed number k of feasible solutions is computed such that the respective best of them is optimal in the worst case. The idea is to calculate a set of candidate solutions in a potentially expensive preprocessing and then select the best solution out of this set ...

Evergreen and deciduous plants are widely expected to have different impacts on soil nitrogen (N) availability because of differences in leaf litter chemistry and ensuing effects on net N mineralization (N(min)). We evaluated this hypothesis by compiling published data on net N(min) rates beneath co-occurring stands of evergreen and deciduous trees. The compiled data included 35 sets of co-occu...

We give the first, as far as we know, feasible proof of König’s Min-Max Theorem (KMM), a fundamental result in combinatorial matrix theory, and we show the equivalence of KMM to various Min-Max principles, with proofs of low complexity.

Modular cut-elimination is a particular notion of ”cut-elimination in the presence of non-logical axioms” that is preserved under the addition of suitable rules. We introduce syntactic necessary and sufficient conditions for modular cut-elimination for standard calculi, a wide class of (possibly) multipleconclusion sequent calculi with generalized quantifiers. We provide a ”universal” modular c...