K. Aardal, Reformulation of capacitated facility location problems : how redundant information can help, Annals of Operations Research, vol.82, p.289308, 1998.

E. Balas, Facets of the knapsack polytope, Mathematical Programming, p.146164, 1975.
DOI : 10.1007/BF01580440

H. Crowder, E. L. Johnson, and M. W. Padberg, Solving Large-Scale Zero-One Linear Programming Problems, Operations Research, vol.31, issue.5, 1983.
DOI : 10.1287/opre.31.5.803

T. Fahle and M. Sellmann, Cost-based ltering for the constrained knapsack problem, Annals of Operations Research, vol.115, p.7393, 2002.

Z. Gu, G. L. Nemhauser, and M. W. Savelsbergh, Cover inequalities for 0-1 linear programs : Computation, INFORMS Journal on Computing, vol.10, p.427437, 1998.
DOI : 10.1287/ijoc.10.4.427
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.119.2535

. Peled, Facets of regular 0-1 polytopes, Mathematical Programming, p.179206, 1975.

B. Hnich, Z. Kiziltan, I. Miguel, and T. Walsh, Hybrid Modelling for Robust Solving, Annals of Operations Research, vol.130, issue.1-4, p.1939, 2004.
DOI : 10.1023/B:ANOR.0000032568.51115.0d
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.125.3904

P. Laborie, Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results, Artificial Intelligence, vol.143, issue.2, p.151188, 2003.
DOI : 10.1016/S0004-3702(02)00362-4

P. Lopez, Approche par contraintes des problèmes d'ordonnancement et d'aectation : structures temporelles et mécanismes de propagation, Décembre 2003

S. Martello and P. Toth, Knapsack problems : algorithms and computer implementations, 1990.

M. Minoux, Discrete cost multicommodity network optimization problems and exact solution methods, Annals of Operations Research, vol.106, 1946.
URL : https://hal.archives-ouvertes.fr/hal-01149564

J. Puget, Improved Bound Computation in Presence of Several Clique Constraints, 10th International Conference on Principles and Practice of Constraint Programming (CP), p.527541, 2004.
DOI : 10.1007/978-3-540-30201-8_39

J. Régin, Generalized arc consistency for global cardinality constraints, 13th National Conference on Articial Intelligence (AAAI), 1996.

M. Sellmann, Approximated Consistency for Knapsack Constraints, 9th International Conference on the Principles and Practice of Constraint Programming (CP), p.679693, 2003.
DOI : 10.1007/978-3-540-45193-8_46

P. Shaw, A Constraint for Bin Packing, 10th International Conference on Principles and Practice of Constraint Programming (CP), pp.649-662, 2004.
DOI : 10.1007/978-3-540-30201-8_47
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.225.1446

A. Michael and . Trick, A dynamic programming approach for consistency and propagation for knapsack constraints

A. Michael and . Trick, Formulations and reformulations for integer programming, 2nd International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR), p.366379, 2005.

A. Laurence and . Wolsey, Faces of linear inequalities in 0-1 variables, Mathematical Programming, pp.165-178, 1975.