Gautier Stauffer

发表

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

Gautier Stauffer, Gautier Stauffer, 2010 .

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

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

How many matchings cover the nodes of a graph? pdf

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

Kidney Exchange Problem: models and algorithms

Hadrien Cambazard, Gautier Stauffer, Lucie Pansart, 2018 .

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

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

Constant approximation algorithms for the one warehouse multiple retailers problem with backlog or lost-sales

Jean-Philippe Gayon, Gautier Stauffer, Christophe Rapine, 2016, Eur. J. Oper. Res..

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

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

France Telecom workforce scheduling problem: a challenge

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

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

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

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

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

A recognition and representation algorithm for fuzzy circular interval graphs

Gianpaolo Oriolo, Gautier Stauffer, Ugo Pietropaoli, 2010 .

The stable set polytope of quasi-line graphs

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

Robust Modeling and Planning: Insights from Three Industrial Applications

Gautier Stauffer, Lavanya Marla, Alexander Rikun, 2020 .

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

Gautier Stauffer, Gautier Stauffer, 2011 .

Column generation for the kidney exchange problem

Hadrien Cambazard, Gautier Stauffer, Lucie Pansart, 2018 .

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

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

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.

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.

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..

Dynamic programming for generalized coloring problems arising in the manufacturing of integrated circuits

Gautier Stauffer, Dehia Ait-Ferhat, Juan Andres Torres, 2017 .

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..

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

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

On the recognition of fuzzy circular interval graphs

Gianpaolo Oriolo, Gautier Stauffer, Ugo Pietropaoli, 2012, Discret. Math..

The Stochastic Shortest Path Problem : A polyhedral combinatorics perspective pdf

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

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

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

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..

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.

Robust planning : Insight from Industrial Applications

Gautier Stauffer, Lavanya Marla, Eleni Pratsini, 2010 .

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

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

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

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

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

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

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..

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

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

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

Gianpaolo Oriolo, Gautier Stauffer, Paolo Ventura, 2011 .