Gautier Stauffer

发表

On the stable set polytope of claw-free graphs

Gautier Stauffer, 2005 .

On the Stable Set Polytope of Claw-free and Circulant Graphs

T. Liebling, G. Oriolo, Gautier Stauffer, 2004 .

The hidden-matching structure of the composition of strips : a polyhedral perspective

G. Oriolo, Gautier Stauffer, Yuri Faenza, 2010 .

Using the economical order quantity formula for inventory control in one‐warehouse multiretailer systems

Gautier Stauffer, 2012 .

A constant approximation for the one-warehouse multi-retailer problem with backorder

Gautier Stauffer, J. Gayon, C. Rapine, 2012 .

Robust Modeling and Planning: Insights from Three Industrial Applications

E. Pratsini, Gautier Stauffer, Lavanya Marla, 2020, Operations Research Perspectives.

Solving the Maximum Weighted Length-Constrained Simple Path

Gautier Stauffer, N. Catusse, H. Cambazard, 2019 .

Robust planning : Insight from Industrial Applications

Gautier Stauffer, Lavanya Marla, Eleni Pratsini, 2010 .

Horizontal collaboration in forestry: game theory models and algorithms for trading demands

G. Oriolo, Mourad Baïou, Gautier Stauffer, 2022, ArXiv.

Coalition formation and cost sharing for truck platooning

Gautier Stauffer, Y. Bouchery, Behzad Hezarkhani, 2022, Transportation Research Part B: Methodological.

Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition

Gianpaolo Oriolo, Gautier Stauffer, Yuri Faenza, 2014, JACM.

Lower bounds for the Chvátal-Gomory rank in the 0/1 cube

Sebastian Pokutta, Gautier Stauffer, Gautier Stauffer, 2011, Oper. Res. Lett..

Approximation algorithms for k-echelon extensions of the one warehouse multi-retailer problem

Gautier Stauffer, 2018, Mathematical Methods of Operations Research.

Approximation algorithms for k-echelon extensions of the one warehouse multi-retailer problem

Gautier Stauffer, Gautier Stauffer, 2018, Math. Methods Oper. Res..

Fast Approximation Algorithms for the One-Warehouse Multi-Retailer Problem Under General Cost Structures and Capacity Constraints

Jean-Philippe Gayon, Gautier Stauffer, Christophe Rapine, 2017, Math. Oper. Res..

A simple and fast 2-approximation algorithm for the one-warehouse multi-retailers problem

Jean-Philippe Gayon, Gautier Stauffer, Christophe Rapine, 2011, SODA '11.

On non-rank facets of the stable set polytope of claw-free graphs and circulant graphs

Gianpaolo Oriolo, Gautier Stauffer, Thomas M. Liebling, 2004, Math. Methods Oper. Res..

Combining lithography and Directed Self Assembly for the manufacturing of vias: Connections to graph coloring problems, integer programming formulations, and numerical experiments

J. Andres Torres, Gautier Stauffer, Dehia Ait-Ferhat, 2020, Eur. J. Oper. Res..

DSA-aware multiple patterning for the manufacturing of vias: Connections to graph coloring problems, IP formulations, and numerical experiments pdf

J. Andres Torres, Gautier Stauffer, Dehia Ait-Ferhat, 2019, ArXiv.

Clique-circulants and the stable set polytope of fuzzy circular interval graphs

Gianpaolo Oriolo, Gautier Stauffer, G. Oriolo, 2008, Math. Program..

Minimum Clique Cover in Claw-Free Perfect Graphs and the Weak Edmonds-Johnson Property

Gianpaolo Oriolo, Gautier Stauffer, Flavia Bonomo, 2013, IPCO.

On the facets of the stable set polytope of quasi-line graphs

Gautier Stauffer, Gautier Stauffer, 2011, Oper. Res. Lett..

Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs

Friedrich Eisenbrand, Gianpaolo Oriolo, Gautier Stauffer, 2005, IPCO.

The Winding Road towards a Characterization of the Stable Set Polytope for Claw-Free Graphs

Gautier Stauffer, Thomas M. Liebling, T. Liebling, 2004, Electron. Notes Discret. Math..

An algorithmic decomposition of claw-free graphs leading to an O(n3)-algorithm for the weighted stable set problem

Gianpaolo Oriolo, Gautier Stauffer, Yuri Faenza, 2011, SODA '11.

The Stochastic Shortest Path Problem : A polyhedral combinatorics perspective pdf

Gautier Stauffer, Matthieu Guillot, Gautier Stauffer, 2017, Eur. J. Oper. Res..

At Play with Combinatorial Optimization, Integer Programming and Polyhedra. (Excursions en Optimisation Combinatoire, Programmation Entiere et Polyedres)

Gautier Stauffer, Gautier Stauffer, 2011 .

The stable set polytope of quasi-line graphs

Friedrich Eisenbrand, Gianpaolo Oriolo, Gautier Stauffer, 2010, Comb..

The $k$-path coloring problem in graphs with bounded treewidth: an application in integrated circuit manufacturing

Gautier Stauffer, Dehia Ait-Ferhat, Andres J. Torres, 2019, ArXiv.

Separating stable sets in claw-free graphs via Padberg-Rao and compact linear programs

Gianpaolo Oriolo, Gautier Stauffer, Yuri Faenza, 2012, SODA.

Stable Sets in Claw-free Graphs : A Journey Through Algorithms and Polytopes

G. Oriolo, P. Ventura, Gautier Stauffer, 2011 .

Stable set in claw-free graphs: recent achievement and future challenges

Gianpaolo Oriolo, Gautier Stauffer, Paolo Ventura, 2011 .

A recognition and representation algorithm for fuzzy circular interval graphs

Gianpaolo Oriolo, Gautier Stauffer, Ugo Pietropaoli, 2010 .

On using the EOQ formula for inventory control in one-warehouse multi-retailers systems

Gautier Stauffer, Gautier Stauffer, 2010 .

France Telecom workforce scheduling problem: a challenge

Gautier Stauffer, Sebastian Pokutta, Gautier Stauffer, 2009, RAIRO Oper. Res..

A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs

Gianpaolo Oriolo, Gautier Stauffer, Ugo Pietropaoli, 2008, IPCO.

The p-median polytope of Y-free graphs: An application of the matching theory

Gautier Stauffer, Gautier Stauffer, 2008, Oper. Res. Lett..

AN INDUSTRIAL CUTTING STOCK PROBLEM

J. Vial, Gautier Stauffer, L. M. Nicoletti, 2002 .

Separation routine and extended formulations for the stable set problem in claw-free graphs

Gianpaolo Oriolo, Gautier Stauffer, Yuri Faenza, 2020, Mathematical Programming.

How many matchings cover the nodes of a graph? pdf

Zoltán Király, Gautier Stauffer, András Sebö, 2018, Math. Program..