Sciweavers

433 search results - page 31 / 87
» Generalized Ham-Sandwich Cuts
Sort
View
EOR
2006
103views more  EOR 2006»
13 years 9 months ago
Exact solutions to a class of stochastic generalized assignment problems
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, ...
COLOGNETWENTE
2009
13 years 11 months ago
Improved Strategies for Branching on General Disjunctions
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 ...
Gérard Cornuéjols, Leo Liberti, Giac...
APAL
2010
123views more  APAL 2010»
13 years 10 months ago
Cut elimination and strong separation for substructural logics: An algebraic approach
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...
Nikolaos Galatos, Hiroakira Ono
IGPL
2008
93views more  IGPL 2008»
13 years 9 months ago
Cut-Based Abduction
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
SODA
2008
ACM
100views Algorithms» more  SODA 2008»
13 years 11 months ago
Yet another algorithm for dense max cut: go greedy
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
Claire Mathieu, Warren Schudy