A. Aggarwal and J. K. Park, Improved Algorithms for Economic Lot Size Problems, Operations Research, vol.41, issue.3, pp.549-571, 1993.
DOI : 10.1287/opre.41.3.549

R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network flows, Theory, algorithms, and applications, 1993.

E. Arkin, D. Joneja, and R. Roundy, Computational complexity of uncapacitated multi-echelon production planning problems, Operations Research Letters, vol.8, issue.2, pp.61-66, 1989.
DOI : 10.1016/0167-6377(89)90001-1

P. Avella and A. Sassano, On the p-Median polytope, Mathematical Programming, pp.395-411, 2001.
DOI : 10.1007/PL00011405

M. Baiou and F. Barahona, On the p-median polytope a special class of graphs, 2007.

M. Ba¨?ouba¨?ou, F. Barahona, and J. Correa, -Median Polytope and the Intersection Property: Polyhedra and Algorithms, SIAM Journal on Discrete Mathematics, vol.25, issue.1, pp.1-20, 2011.
DOI : 10.1137/090747440

E. Balas, Disjunctive Programming, Annals of Discrete Mathematics, vol.5, pp.3-51, 1979.
DOI : 10.1016/S0167-5060(08)70342-X

J. J. Bartholdi, J. B. Orlin, and H. Ratliff, Cyclic Scheduling via Integer Programs with Circular Ones, Operations Research, vol.28, issue.5, pp.1074-1085, 1980.
DOI : 10.1287/opre.28.5.1074

A. B. Rebea, ´ Etude des stables dans les graphes quasi-adjoints, 1981.

C. Berge, Graphs and Hypergraphs, 1973.

S. Beyer and D. Sethi, A proof of the EOQ formula using quasi-variational inequalities, International Journal of Systems Science, vol.29, issue.11, pp.1295-1299, 1998.
DOI : 10.1287/mnsc.35.7.898

A. Bockmayr, F. Eisenbrand, M. Hartmann, and A. Schulz, On the Chv??tal rank of polytopes in the 0/1 cube, Discrete Applied Mathematics, vol.98, issue.1-2, pp.21-27, 1999.
DOI : 10.1016/S0166-218X(99)00156-0

A. Brandstädt and F. F. Dragan, On linear and circular structure of (claw, net)-free graphs, Discrete Applied Mathematics, vol.129, issue.2-3, pp.285-303, 2003.
DOI : 10.1016/S0166-218X(02)00571-1

G. Calvillo, The Concavity and Intersection Properties for Integral Polyhedra, Annals of Discrete Mathematics, 1981.
DOI : 10.1016/S0167-5060(08)70877-X

E. Cheng and S. De-vries, Antiweb inequalities: strength and intractability, Congressus Numerantium, vol.152, pp.5-19, 2001.

E. Cheng and S. De-vries, Antiweb inequalities: strength and intractability, Math Programming, pp.153-175, 2002.

M. Chudnovsky and P. Seymour, The structure of claw-free graphs, Surveys in Combinatorics 2005, London Math. Soc. Lecture Note Series, pp.153-171, 2005.
DOI : 10.1017/CBO9780511734885.008

M. Chudnovsky and P. Seymour, Claw-free graphs. III. Circular interval graphs, Journal of Combinatorial Theory, Series B, vol.98, issue.4, pp.812-834, 2008.
DOI : 10.1016/j.jctb.2008.03.001

M. Chudnovsky and P. Seymour, Simplicial cliques in claw-free graphs, 2010.

V. Chvátal, W. Cook, and M. Hartmann, On cutting-plane proofs in combinatorial optimization. Linear algebra and its applications, pp.455-499, 1989.

G. Cornuéjols, Valid inequalities for mixed integer linear programs, Mathematical Programming, pp.3-44, 2008.
DOI : 10.1007/s10107-006-0086-0

X. Deng, P. Hell, and J. Huang, Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs, SIAM Journal on Computing, vol.25, issue.2, pp.390-403, 1996.
DOI : 10.1137/S0097539792269095

J. Edmonds, Maximum matching and a polyhedron with 0,1-vertices, Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, vol.69, issue.1 and 2, pp.125-130, 1965.
DOI : 10.6028/jres.069B.013

J. Edmonds and W. Pulleyblank, Facets of 1-matching polyhedra, Hypergraph Seminar, pp.214-242, 1974.

F. Eisenbrand, G. Oriolo, G. Stauffer, and P. Ventura, Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs, Proceedings of the 11th IPCO Conference, Lecture notes in computer science, pp.291-305, 2005.
DOI : 10.1007/11496915_22

F. Eisenbrand, G. Oriolo, G. Stauffer, and P. Ventura, The stable set polytope of quasi-line graphs, Combinatorica, vol.71, issue.3, pp.45-67, 2008.
DOI : 10.1007/s00493-008-2244-x
URL : https://hal.archives-ouvertes.fr/inria-00442284

F. Eisenbrand and A. Schulz, Bounds on the Chv??tal Rank of Polytopes in the 0/1-Cube, Combinatorica, vol.23, issue.2, pp.245-261, 2003.
DOI : 10.1007/3-540-48777-8_11

Y. Faenza, G. Oriolo, and G. Stauffer, Separating stable sets in claw-free graphs via Padberg-Rao and compact linear programs
DOI : 10.1137/1.9781611973099.102
URL : https://hal.archives-ouvertes.fr/hal-00648011

Y. Faenza, G. Oriolo, and G. Stauffer, The hidden-matching structure of the composition of strips : a polyhedral perspective
URL : https://hal.archives-ouvertes.fr/inria-00452173

Y. Faenza, G. Oriolo, and G. Stauffer, A O(n 3 ) algorithm for the stable set problem in claw-free graphs, Proceedings of SODA 2011 Conference, pp.630-646, 2011.

Y. Faenza, G. Oriolo, and G. Stauffer, Solving the maximum weighted stable set problem in claw-free graphs via decomposition, 2011.

Y. Faenza, G. Oriolo, G. Stauffer, and P. Ventura, Stable Sets in Claw-free Graphs: a journey through algorithms and polytopes, Progess in Combinatorial Optimization, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00648014

T. Fujito and H. Nagamochi, A 2-approximation algorithm for the minimum weight edge dominating set problem, Discrete Applied Mathematics, vol.118, issue.3, 2002.
DOI : 10.1016/S0166-218X(00)00383-8

H. N. Gabow, Data structures for weighted matching and nearest common ancestors with linking, Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms, 1990.

A. Galluccio and A. Sassano, The Rank Facets of the Stable Set Polytope for Claw-Free Graphs, Journal of Combinatorial Theory, Series B, vol.69, issue.1, pp.1-38, 1997.
DOI : 10.1006/jctb.1996.1715

M. R. Garey and D. S. Johnson, Computers and Intractability. A Guide to the Theory of NP- Completeness. Freemann, 1979.

J. Gayon, G. Massonnet, C. Rapine, and G. Stauffer, Computational experiments with various methods for the OWMR

J. Gayon, G. Massonnet, C. Rapine, and G. Stauffer, A simple 2-approximation algorithm for the deterministic lot-sizing problem with backorders

D. Gijswijt, On a packet scheduling problem for smart antennas and polyhedra defined by circular-ones matrices, Electronic Notes in Discrete Mathematics, vol.17, 2003.
DOI : 10.1016/j.endm.2004.03.035

R. Giles and L. Trotter, On stable set polyhedra for K1,3-free graphs, Journal of Combinatorial Theory, Series B, vol.31, issue.3, pp.313-326, 1981.
DOI : 10.1016/0095-8956(81)90033-2

P. C. Gilmore and R. E. Gomory, A Linear Programming Approach to the Cutting-Stock Problem, Operations Research, vol.9, issue.6, pp.849-859, 1961.
DOI : 10.1287/opre.9.6.849

R. Gomory, Outline of an algorithm for integer solutions to linear programs. Bulletin of the, pp.275-278, 1958.

R. Gomory, Solving linear programming problems in integers, Proceedings of Symposia in Applied Mathematics X, pp.211-215, 1960.
DOI : 10.1090/psapm/010/0114670

M. Grötschel, L. Lovász, and A. Schrijver, The ellipsoid method and its consequences in combinatorial optimization, Combinatorica, vol.2, issue.2, pp.169-197, 1981.
DOI : 10.1007/BF02579273

M. Grötschel, L. Lovász, and A. Schrijver, Geometric algorithms and combinatorial optimization, 1988.

A. Gupta, R. Krishnaswamy, M. Molinaro, and R. Ravi, Approximation algorithms for correlated knapsacks and non-martingale bandits Kratsch. On claw-free asteroidal triple-free graphs, Discrete Applied Mathematics, vol.121, pp.155-180, 2002.

D. Hermelin, M. Mnich, E. V. Leeuwen, and G. Woeginger, Domination When the Stars Are Out, Proceedings of ICALP 2011, 2011.
DOI : 10.1137/0138030

V. Kaibel and A. Loos, Branched Polyhedral Systems, Proceedings of IPCO XIV, pp.177-190, 2010.
DOI : 10.1007/978-3-642-13036-6_14

O. Kariv and L. Hakimi, -Medians, SIAM Journal on Applied Mathematics, vol.37, issue.3, pp.539-560, 1979.
DOI : 10.1137/0137041

R. M. Karp and C. H. Papadimitriou, On Linear Characterizations of Combinatorial Optimization Problems, SIAM Journal on Computing, vol.11, issue.4, pp.620-632, 1982.
DOI : 10.1137/0211053

L. Khachiyan, Polynomial algorithms in linear programming, USSR Computational Mathematics and Mathematical Physics, vol.20, issue.1, pp.1093-1097, 1979.
DOI : 10.1016/0041-5553(80)90061-0

A. King, Claw-free graphs and two conjectures on ?, ?, and ?, 2009.

T. Kloks, D. Kratsch, and H. Müller, Finding and counting small induced subgraphs efficiently, Information Processing Letters, vol.74, issue.3-4, pp.115-121, 2000.
DOI : 10.1016/S0020-0190(00)00047-8
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.49.1750

J. Krausz, Demonstration nouvelle d'une theoreme de whitney sur les reseaux, Math. Fis. Lapok, vol.50, pp.75-89, 1943.

H. W. Kuhn and A. W. Tucker, Nonlinear programming, Proceedings of 2nd Berkeley Symposium, pp.481-492, 1951.

R. Levi, R. Roundy, D. Shmoys, and M. Sviridenko, A Constant Approximation Algorithm for the One-Warehouse Multiretailer Problem, Management Science, vol.54, issue.4, pp.763-776, 2008.
DOI : 10.1287/mnsc.1070.0781

T. Liebling, G. Oriolo, B. Spille, and G. Stauffer, On non-rank facets of the stable set polytope of claw-free graphs and circulant graphs, Mathematical Methods of Operations Research (ZOR), vol.59, issue.1, pp.25-35, 2004.
DOI : 10.1007/s001860300317

L. Lovasz and M. Plummer, Matching Theory, 1986.
DOI : 10.1090/chel/367

L. Marla, E. Pratsini, A. Rikun, and G. Stauffer, Robust planning : Insight from Industrial Applications
URL : https://hal.archives-ouvertes.fr/inria-00463670

R. K. Martin, R. L. Rardin, and B. A. Campbell, Polyhedral Characterization of Discrete Dynamic Programming, Operations Research, vol.38, issue.1, pp.127-138, 1990.
DOI : 10.1287/opre.38.1.127

A. Miller, R. Sadycov, and G. Stauffer, Algorithms for the multi-linear optimization problem

G. Minty, On maximal independent sets of vertices in claw-free graphs, Journal of Combinatorial Theory, Series B, vol.28, issue.3, pp.284-304, 1980.
DOI : 10.1016/0095-8956(80)90074-X

G. L. Nemhauser and L. A. Wolsey, Integer and Combinatorial Optimization, 1988.
DOI : 10.1002/9781118627372
URL : http://dx.doi.org/10.1016/s0898-1221(99)91259-2

L. M. Nicoletti, G. Stauffer, and J. Vial, An Industrial Cutting Stock Problem, Decision and Control in Management Science. kluwer, 2002.
DOI : 10.1007/978-1-4757-3561-1_16
URL : https://hal.archives-ouvertes.fr/inria-00442288

G. Oriolo, Clique family inequalities for the stable set polytope of quasi-line graphs, Discrete Applied Mathematics, vol.132, issue.1-3, pp.185-201, 2003.
DOI : 10.1016/S0166-218X(03)00400-1

G. Oriolo, U. Pietropaoli, and G. Stauffer, A recognition and representation algorithm for fuzzy circular interval graphs
URL : https://hal.archives-ouvertes.fr/inria-00463668

G. Oriolo, U. Pietropaoli, and G. Stauffer, A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs, Proceedings of the 12th IPCO Conference, pp.77-96, 2008.
DOI : 10.1007/978-3-540-68891-4_6
URL : https://hal.archives-ouvertes.fr/inria-00442281

G. Oriolo, U. Pietropaoli, and G. Stauffer, A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs, Proceedings of the 12th IPCO Conference, Lecture notes in computer science, 2008.
DOI : 10.1007/978-3-540-68891-4_6
URL : https://hal.archives-ouvertes.fr/inria-00442281

G. Oriolo and G. Stauffer, On the non rank-facets of the stable set polytope of quasi-line graphs
URL : https://hal.archives-ouvertes.fr/inria-00452175

G. Oriolo and G. Stauffer, Clique-circulants and the stable set polytope of fuzzy circular interval graphs, Mathematical Programming, vol.12, issue.3, pp.291-317, 2008.
DOI : 10.1007/s10107-007-0176-7

G. Oriolo, G. Stauffer, and P. Ventura, Stable set in claw-free graphs: recent achievement and future challenges, Optima, vol.86, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00648013

G. Oriolo, G. Stauffer, and P. Ventura, Stable sets in claw-free graphs: recent achievements and future challenges, Optima, vol.86, 2011.

L. Pachter and B. Sturmfels, Parametric inference for biological sequence analysis, Proceedings of the National Academy of Sciences (PNAS), pp.16138-16143, 2004.
DOI : 10.1073/pnas.0406011101
URL : http://www.ncbi.nlm.nih.gov/pmc/articles/PMC528961

M. Padberg, On the facial structure of set packing polyhedra, Mathematical Programming, vol.18, issue.1, pp.199-215, 1973.
DOI : 10.1007/BF01580121

M. W. Padberg and M. R. Rao, The russian method for linear programming III: Bounded integer programming, 1981.
URL : https://hal.archives-ouvertes.fr/inria-00076483

M. W. Padberg and M. R. Rao, -Matchings, Mathematics of Operations Research, vol.7, issue.1, pp.67-80, 1982.
DOI : 10.1287/moor.7.1.67
URL : https://hal.archives-ouvertes.fr/hal-00270767

A. Pêcher and A. K. Wagler, On facets of stable set polytopes of claw-free graphs with stability number three, Electronic Notes in Discrete Mathematics, vol.28, issue.3, pp.493-498, 2010.
DOI : 10.1016/j.endm.2007.01.025

S. Pokutta and G. Stauffer, France Telecom workforce scheduling problem: a challenge, RAIRO - Operations Research, vol.43, issue.4, pp.375-386, 2009.
DOI : 10.1051/ro/2009025
URL : https://hal.archives-ouvertes.fr/inria-00442261

S. Pokutta and G. Stauffer, Lower bounds for the Chv??tal???Gomory rank in the 0/1 cube, Operations Research Letters, vol.39, issue.3, pp.200-203, 2011.
DOI : 10.1016/j.orl.2011.03.001

W. Pulleyblank and B. Shepherd, Formulations of the stable set polytope, Proceedings Third IPCO Conference, pp.267-279, 1993.

W. Pulleyblank and F. Shepherd, Formulations for the stable set polytope of a claw-free graph, Proceedings Third IPCO Conference, pp.267-279, 1993.

R. O. Roundy, 98%-Effective Integer-Ratio Lot-Sizing for One-Warehouse Multi-Retailer Systems, Management Science, vol.31, issue.11, pp.1416-1430, 1985.
DOI : 10.1287/mnsc.31.11.1416

N. Roussopoulos, A max {m,n} algorithm for determining the graph H from its line graph G, Information Processing Letters, vol.2, issue.4, pp.108-112, 1973.
DOI : 10.1016/0020-0190(73)90029-X

A. Schrijver, On Cutting Planes, Annals of Discrete Mathematics, vol.9, pp.291-296, 1980.
DOI : 10.1016/S0167-5060(08)70085-2

A. Schrijver, Theory of Linear and Integer Programming, 1986.

A. Schrijver, Combinatorial optimization, 2003.

G. Stauffer, On using the EOQ formula for inventory control in one-warehouse multi-retailers systems . Under revision at Naval Research Logistics
URL : https://hal.archives-ouvertes.fr/inria-00452187

G. Stauffer, On the stable set polytope of claw-free graphs, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00442287

G. Stauffer, The -median polytope of -free graphs: An application of the matching theory, Operations Research Letters, vol.36, issue.3, pp.351-354, 2008.
DOI : 10.1016/j.orl.2007.09.006
URL : https://hal.archives-ouvertes.fr/inria-00442282

G. Stauffer, On the facets of the stable set polytope of quasi-line graphs, Operations Research Letters, vol.39, issue.3, pp.208-212, 2011.
DOI : 10.1016/j.orl.2011.02.009
URL : https://hal.archives-ouvertes.fr/inria-00452175

G. Stauffer and T. Liebling, The Winding Road towards a Characterization of the Stable Set Polytope for Claw-Free Graphs, Proceedings of the Latin-American Conference on Combinatorics, Graphs and Applications, pp.213-218, 2004.
DOI : 10.1016/j.endm.2004.06.034
URL : https://hal.archives-ouvertes.fr/inria-00442286

G. Stauffer, G. Massonnet, C. Rapine, and J. Gayon, A simple and fast 2-approximation algorithm for the one-warehouse multi-retailers problem, Proceedings of SODA 2011 Conference, pp.67-79, 2011.
DOI : 10.1137/1.9781611973082.6

A. Tamir, An O(pn2) algorithm for the p-median and related problems on tree graphs, Operations Research Letters, vol.19, issue.2, pp.59-64, 1996.
DOI : 10.1016/0167-6377(96)00021-1

L. Trotter, A class of facet producing graphs for vertex packing polyhedra, Discrete Mathematics, vol.12, issue.4, pp.373-388, 1975.
DOI : 10.1016/0012-365X(75)90077-1

H. Wagner and T. Whitin, Dynamic Version of the Economic Lot Size Model, Management Science, vol.5, issue.1, pp.89-96, 1958.
DOI : 10.1287/mnsc.5.1.89