Sophie Toulouse

According to our database1, Sophie Toulouse authored at least 17 papers between 2003 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Approximation of the Double Traveling Salesman Problem with Multiple Stacks.
Theor. Comput. Sci., 2021

2020
Approximation of the Double Travelling Salesman Problem with Multiple Stacks.
CoRR, 2020

2018
A new effective unified model for solving the Pre-marshalling and Block Relocation Problems.
Eur. J. Oper. Res., 2018

How Far From a Worst Solution a Random Solution of a kCSP Instance Can Be?
Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018

2 CSPs All Are Approximable Within a Constant Differential Factor.
Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018

2012
Differential Approximation of the Multiple Stacks TSP.
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

2010
Approximability of the Multiple Stack TSP.
Electron. Notes Discret. Math., 2010

2009
On the Complexity of the Multiple Stack TSP, kSTSP.
Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009

2008
Approximation results for the weighted P<sub>4</sub> partition problem.
J. Discrete Algorithms, 2008

Rapport de recherche sur le problème du plus court chemin contraint
CoRR, 2008

2007
The path partition problem and related problems in bipartite graphs.
Oper. Res. Lett., 2007

The P<sub>k</sub> Partition Problem and Related Problems in Bipartite Graphs.
Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007

2005
Approximation Results for the Weighted P<sub>4</sub> Partition Problems.
Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

2004
Local approximations for maximum partial subgraph problem.
Oper. Res. Lett., 2004

2003
Optima locaux garantis pour l'approximation différentielle.
Tech. Sci. Informatiques, 2003

Approximation algorithms for the traveling salesman problem.
Math. Methods Oper. Res., 2003

Differential approximation results for the traveling salesman problem with distances 1 and 2.
Eur. J. Oper. Res., 2003


  Loading...