Similar Search Results

Moderately exponential time and fixed parameter approximation algorithms

Escoffier, Bruno; Paschos, Vangelis Th.; Tourniaire, Emeric - In: Optimization : a journal of mathematical programming … 62 (2013) 8, pp. 1019-1036

Persistent link: https://www.econbiz.de/10010157881

Differential approximation of min sat, max sat and related problems

Escoffier, Bruno; Paschos, Vangelis Th. - In: European Journal of Operational Research 181 (2007) 2, pp. 620-633

Persistent link: https://www.econbiz.de/10005277639

When polynomial approximation meets exact computation

Paschos, Vangelis Th. - In: Seven surveys in operations research, (pp. 87-103). 2018

Persistent link: https://www.econbiz.de/10011937383

Combinatorial approximation of maximum k-VERTEX cover in bipartite graphs within ration 0.7

Paschos, Vangelis Th. - In: RAIRO / Operations research 52 (2018) 1, pp. 305-314

Persistent link: https://www.econbiz.de/10011968720

When polynomial approximation meets exact computation

Paschos, Vangelis Th. - In: 4OR : a quarterly journal of operations research 13 (2015) 3, pp. 227-245

Persistent link: https://www.econbiz.de/10011347901

Two-stage stochastic matching and spanning tree problems: Polynomial instances and approximation

Escoffier, Bruno; Gourvès, Laurent; Monnot, Jérôme; … - In: European Journal of Operational Research 205 (2010) 1, pp. 19-30

This article deals with the two-stage stochastic model, which aims at explicitly taking into account uncertainty in optimization problems, that Kong and Schaefer have recently studied for the maximum weight matching problem [N. Kong, A.J. Schaefer, A factor 1/2 approximation algorithm for...

Persistent link: https://www.econbiz.de/10008551219

Some tractable instances of interval data minmax regret problems

Escoffier, Bruno; Monnot, Jérôme; Spanjaard, Olivier - In: Operations research letters 36 (2008) 4, pp. 424-429

Persistent link: https://www.econbiz.de/10003786695

Two-stage stochastic matching and spanning tree problems : polynomial instances and approximation

Escoffier, Bruno; Gourvès, Laurent; Monnot, Jérôme; … - In: European journal of operational research : EJOR 205 (2010) 1, pp. 19-30

Persistent link: https://www.econbiz.de/10003958650

Some tractable instances of interval data minmax regret problems

Escoffier, Bruno; Monnot, Jérôme; Spanjaard, Olivier - In: Operations research letters 36 (2008) 4, pp. 424-429

Persistent link: https://www.econbiz.de/10008077547

Improved worst-case complexity for the MIN 3-SET COVERING problem

Della Croce, Federico; Escoffier, Bruno; Paschos, … - In: Operations research letters 35 (2007) 2, pp. 205-210

Persistent link: https://www.econbiz.de/10007607173