Differential approximation results for the traveling salesman problem with distances 1 and 2. - Jérôme Monnot; Vangelis Th. Paschos; Sophie Toulouse (Eur. J. Oper. Res., 2003)

Approximation algorithms for the traveling salesman problem. - Jérôme Monnot; Vangelis Th. Paschos; Sophie Toulouse (Math. Methods Oper. Res., 2003)

Optima locaux garantis pour l'approximation différentielle. - Jérôme Monnot; Vangelis Th. Paschos; Sophie Toulouse (Tech. Sci. Informatiques, 2003)

Local approximations for maximum partial subgraph problem. - Jérôme Monnot; Vangelis Th. Paschos; Sophie Toulouse (Oper. Res. Lett., 2004)

Approximation Results for the Weighted P4 Partition Problems. - Jérôme Monnot; Sophie Toulouse (FCT, 2005)

The Pk Partition Problem and Related Problems in Bipartite Graphs. - Jérôme Monnot; Sophie Toulouse (SOFSEM (1), 2007)

The path partition problem and related problems in bipartite graphs. - Jérôme Monnot; Sophie Toulouse (Oper. Res. Lett., 2007)

Rapport de recherche sur le problème du plus court chemin contraint - Olivier Laval; Sophie Toulouse; Anass Nagih (CoRR, 2008)

Approximation results for the weighted P4 partition problem. - Jérôme Monnot; Sophie Toulouse (J. Discrete Algorithms, 2008)

On the Complexity of the Multiple Stack TSP, kSTSP. - Sophie Toulouse; Roberto Wolfler Calvo (TAMC, 2009)

Approximability of the Multiple Stack TSP. - Sophie Toulouse (Electron. Notes Discret. Math., 2010)

Differential Approximation of the Multiple Stacks TSP. - Sophie Toulouse (ISCO, 2012)

2 CSPs All Are Approximable Within a Constant Differential Factor. - Jean-François Culus; Sophie Toulouse (ISCO, 2018)

How Far From a Worst Solution a Random Solution of a kCSP Instance Can Be? - Jean-François Culus; Sophie Toulouse (IWOCA, 2018)

A new effective unified model for solving the Pre-marshalling and Block Relocation Problems. - Marcos de Melo da Silva; Sophie Toulouse; Roberto Wolfler Calvo (Eur. J. Oper. Res., 2018)

Approximation of the Double Travelling Salesman Problem with Multiple Stacks. - Laurent Alfandari; Sophie Toulouse (CoRR, 2020)

Approximation of the Double Traveling Salesman Problem with Multiple Stacks. - Laurent Alfandari; Sophie Toulouse (Theor. Comput. Sci., 2021)

Optimizing alphabet reduction pairs of arrays. - Jean-François Culus; Sophie Toulouse (CoRR, 2024)

Deriving differential approximation results for k,CSPs from combinatorial designs. - Jean-François Culus; Sophie Toulouse (CoRR, 2024)