This paper deals with a stochastic Generalized Assignment Problem with recourse. Only a random subset of the given set of jobs will require to be actually processed. An assignment...
Maria Albareda-Sambola, Maarten H. van der Vlerk, ...
Abstract Within the context of solving Mixed-Integer Linear Programs by a Branch-andCut algorithm, we propose a new strategy for branching. Computational experiments show that, on ...
Abstract. We develop a general algebraic and proof-theoretic study of substructural logics that may lack associativity, along with other structural rules. Our study extends existin...
In this paper we explore a generalization of traditional abduction which can simultaneously perform two different tasks: (i) given an unprovable sequent G, find a sentence H such ...
Marcello D'Agostino, Marcelo Finger, Dov M. Gabbay
We study dense instances of MaxCut and its generalizations. Following a long list of existing, diverse and often sophisticated approximation schemes, we propose taking the na