Escoffier Bruno

Bruno Escoffier

Information about the author Bruno Escoffier will soon be added to the site.
Found 7 papers in total
Fast Algorithms for max independent set
Fast Algorithms for max independent set
2012
We first propose a method, called ‘bottom‐up method’ that,...
Some tractable instances of interval data minmax regret problems
Some tractable instances of interval data minmax regret problems
2008
In this paper, we provide polynomial and pseudopolynomial algorithms for classes of...
Two-stage stochastic matching and spanning tree problems: Polynomial instances and approximation
Two-stage stochastic matching and spanning tree problems: Polynomial instances and approximation
2010
This article deals with the two-stage stochastic model, which aims at explicitly...
Simple and fast reoptimizations for the Steiner tree problem
Simple and fast reoptimizations for the Steiner tree problem
2009
We address reoptimization issues for the Steiner tree problem. We assume that an...
Approximation of the Quadratic Set Covering problem
Approximation of the Quadratic Set Covering problem
2007
We study in this article the polynomial approximation properties of the Quadratic Set...
Improved worst-case complexity for the MIN 3-SET COVERING problem
Improved worst-case complexity for the MIN 3-SET COVERING problem
2007
We consider MIN SET COVERING when the subsets are constrained to have maximum...
On-line models and algorithms for max independent set
On-line models and algorithms for max independent set
2006
In on-line computation, the instance of the problem dealt is not entirely known from...
Papers per page: