Similar Search Results

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-430

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

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

On the performance of congestion games for optimum satisfiability problems

Giannakos, Aristotelis; Gourvès, Laurent; Monnot, Jérôme - In: Internet and network economics : third international …, (pp. 220-231). 2007

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

Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems

Della Croce, Federico; Paschos, Vangelis Th. - In: Operational research : an international journal ; the … 8 (2008) 3, pp. 235-256

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

On the max-weight edge coloring problem

Lucarelli, Giorgio; Milis, Ioannis; Paschos, Vangelis Th. - In: Journal of combinatorial optimization 20 (2010) 4, pp. 429-442

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

The max quasi-independent set problem

Bourgeois, Nicolas; Giannakos, Aristotelis; Lucarelli, … - In: Journal of combinatorial optimization 23 (2012) 1, pp. 94-117

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

Parameterized (in)approximability of subset problems

Bonnet, Édouard; Paschos, Vangelis Th. - In: Operations research letters 42 (2014) 3, pp. 222-225

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

Approximation algorithms for the traveling salesman problem

Monnot, Jérôme; Paschos, Vangelis Th.; Toulouse, Sophie - In: Mathematical methods of operations research 56 (2002) 3, pp. 387-405

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

Dual parameterization and parameterized approximability of subset graph problems

Bonnet, Édouard; Paschos, Vangelis Th. - In: RAIRO / Operations research 51 (2017) 1, pp. 261-266

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

Exact and superpolynomial approximation algorithms for the densest k-subgraph problem

Bourgeois, Nicolas; Giannakos, Aristotelis; Lucarelli, … - In: European journal of operational research : EJOR 262 (2017) 3, pp. 894-903

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