The papers in this special issue originated at SAT 2001, the Fourth International Symposium on the Theory and Applications of Satisfiability Testing. This foreword reviews the cu...
This paper presents techniques for handling symmetries in integer linear programs where variables can take integer values, extending previous work dealing exclusively with binary v...
Abstract. Combining classical approximability questions with parameterized complexity, we introduce a theory of parameterized approximability. The main intention of this theory is ...
We describe a new software package, named SumCracker, for proving and finding identities involving symbolic sums and related objects. SumCracker is applicable to a wide range of e...
We show that for even quasi-concave objective functions the worst-case distribution, with respect to a family of unimodal distributions, of a stochastic programming problem is a u...