1. Recherche
28 résultats  enregistrer la recherche
hal-00800191v1  Communication dans un congrès
Guillaume Massonnet, Jean-Philippe Gayon, Christophe Rapine, Gautier Stauffer. A Constant Approximation for the One-Warehouse Multiretailers problem with backorder
INCOM 12, May 2012, Bucharest, Romania. 14 (1), pp.1487 - 1492, 2012
...
tel-00653059v1  HDR
Gautier Stauffer. At Play with Combinatorial Optimization, Integer Programming and Polyhedra
Optimization and Control [math.OC]. Université Sciences et Technologies - Bordeaux I, 2011
inria-00463671v1  Communication dans un congrès
Yuri Faenza, Gianpaolo Oriolo, Gautier Stauffer. An Algorithmic Decomposition of Claw-free Graphs Leading to an O(n^3)-algorithm for the Weighted Stable Set Problem
Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA) 2011, Jan 2011, San Francisco, United States. SIAM, 2010
inria-00442287v1  Article dans une revue
Thomas Liebling, Gianpaolo Oriolo, Bianca Spille, Gautier Stauffer. On the Stable Set Polytope of Claw-free and Circulant Graphs
Mathematical Methods of Operations Research, Springer Verlag, 2004
inria-00539042v1  Communication dans un congrès
Gautier Stauffer, Guillaume Massonnet, Christophe Rapine, Jean-Philippe Gayon. A simple and fast 2-approximation algorithm for the one warehouse multi-retailer problem
Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA) 2011, Jan 2011, San Francisco, United States. SIAM, 2011
hal-00648011v1  Communication dans un congrès
Yuri Faenza, Gianpaolo Oriolo, Gautier Stauffer. Separating stable sets in claw-free graphs via Padberg-Rao and compact linear programs
ACM-SIAM Symposium on Discrete Algorithms, Jan 2012, Kyoto, Japan. 2012
hal-00648014v1  Chapitre d'ouvrage
Yuri Faenza, Gianpaolo Oriolo, Gautier Stauffer, Paolo Ventura. Stable Sets in Claw-free Graphs : A Journey Through Algorithms and Polytopes
A. Ridha Mahjoub. Progress in Combinatorial Optimization., Wiley, 2011
inria-00442281v1  Article dans une revue
Gianpaolo Oriolo, Ugo Pietropaoli, Gautier Stauffer. A new algorithm for the maximum weighted stable set problem in claw-free graphs
Lecture notes in computer science. Proceedings of the 13th IPCO Conference, springer, 2008, Proceedings of the 13th IPCO Conference
inria-00442283v1  Article dans une revue
Gianpaolo Oriolo, Gautier Stauffer. Clique-Circulant for the Stable Set Polytope of Quasi-line Graphs
Mathematical Programming, Series A, Springer, 2008
inria-00442285v1  Article dans une revue
Friedrich Eisenbrand, Gianpaolo Oriolo, Gautier Stauffer, Paolo Ventura. Circular-one matrices and the stable set polytope of quasi-line graphs
Lecture notes in computer science. Proceedings of the 11th IPCO Conference, Springer, 2005, Proceedings of the 11th IPCO Conference
inria-00442288v1  Article dans une revue
Luciano Muller Nicoletti, Gautier Stauffer, Jean-Philippe Vial. An Industrial Cutting Stock Problem
Decision and Control in Management Science, Zaccour, Georges, 2002
hal-00761799v1  Article dans une revue
G. Oriolo, Ugo Pietropaoli, Gautier Stauffer. On the recognition of fuzzy circular interval graphs
Discrete Mathematics, Elsevier, 2012, 312 (8)
inria-00442282v1  Article dans une revue
Gautier Stauffer. The p-median Polytope of Y-free Graphs: An Application of the Matching Theory
Operations Research Letters, Elsevier, 2008
inria-00539038v1  Article dans une revue
Sebastian Pokutta, Gautier Stauffer. Lower bounds for the Chvátal-Gomory closure in the 0/1 cube
Operations Research Letters, Elsevier, 2011, 39 (3), pp.200-203. <10.1016/j.orl.2011.03.001>
inria-00463669v1  Article dans une revue
Gautier Stauffer. The strongly minimal facets of the stable set polytope of quasi-line graphs
Operations Research Letters, Elsevier, 2011, 39 (3), pp.208-212. <10.1016/j.orl.2011.02.009>
inria-00442261v1  Article dans une revue
Sebastian Pokutta, Gautier Stauffer. France Telecom Workforce Scheduling problem : A Challenge
RAIRO - Operations Research, EDP Sciences, 2009, 43 (4), pp.375-386. <10.1051/ro/2009025>

Contact


archive-ouverte@inria.fr