Sophie Toulouse

22 papers B 2C 4Journal 15Unranked 1
YearRankTypeTitle / Venue / Authors
2024 J jnl
Deriving differential approximation results for k,CSPs from combinatorial designs.
CoRR
Jean-François Culus, Sophie Toulouse
2024 J jnl
Optimizing alphabet reduction pairs of arrays.
CoRR
Jean-François Culus, Sophie Toulouse
2021 J jnl
Approximation of the Double Traveling Salesman Problem with Multiple Stacks.
Theor. Comput. Sci.
Laurent Alfandari, Sophie Toulouse
2020 J jnl
Approximation of the Double Travelling Salesman Problem with Multiple Stacks.
CoRR
Laurent Alfandari, Sophie Toulouse
2018 C conf
2 CSPs All Are Approximable Within a Constant Differential Factor.
ISCO
Jean-François Culus, Sophie Toulouse
2018 J jnl
A new effective unified model for solving the Pre-marshalling and Block Relocation Problems.
Eur. J. Oper. Res.
Marcos de Melo da Silva, Sophie Toulouse, Roberto Wolfler Calvo
2018 C conf
How Far From a Worst Solution a Random Solution of a kCSP Instance Can Be?
IWOCA
Jean-François Culus, Sophie Toulouse
2012 C conf
Differential Approximation of the Multiple Stacks TSP.
ISCO
Sophie Toulouse
2010 J jnl
Approximability of the Multiple Stack TSP
CoRR
Sophie Toulouse
2010 J jnl
Approximability of the Multiple Stack TSP.
Electron. Notes Discret. Math.
Sophie Toulouse
2010 J jnl
On the complexity of the multiple stack TSP, kSTSP
CoRR
Sophie Toulouse, Roberto Wolfler Calvo
2009 C conf
On the Complexity of the Multiple Stack TSP, kSTSP.
TAMC
Sophie Toulouse, Roberto Wolfler Calvo
2008 J jnl
Approximation results for the weighted P
J. Discrete Algorithms
Jérôme Monnot, Sophie Toulouse
2008 J jnl
Rapport de recherche sur le problème du plus court chemin contraint
CoRR
Olivier Laval, Sophie Toulouse, Anass Nagih
2007 — conf
The P
SOFSEM (1)
Jérôme Monnot, Sophie Toulouse
2007 J jnl
The path partition problem and related problems in bipartite graphs.
Oper. Res. Lett.
Jérôme Monnot, Sophie Toulouse
2005 B conf
Approximation Results for the Weighted P
FCT
Jérôme Monnot, Sophie Toulouse
2004 J jnl
Local approximations for maximum partial subgraph problem.
Oper. Res. Lett.
Jérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse
2003 J jnl
Approximation algorithms for the traveling salesman problem.
Math. Methods Oper. Res.
Jérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse
2003 J jnl
Differential approximation results for the traveling salesman problem with distances 1 and 2.
Eur. J. Oper. Res.
Jérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse
2003 J jnl
Optima locaux garantis pour l'approximation différentielle.
Tech. Sci. Informatiques
Jérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse
2001 B conf
Differential Approximation Results for the Traveling Salesman Problem with Distances 1 and 2.
FCT
Jérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse