R. Euro-challenge, A large-scale energy management problem with varied constraints, 2010.

A. Amaral and A. N. Letchford, An exact algorithm for general orthogonal twodimensional knapsack problems, 2002.

R. Baldacci and M. A. Boschetti, A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem, European Journal of Operational Research, vol.183, issue.3, pp.1136-1149, 2007.
DOI : 10.1016/j.ejor.2005.11.060

J. E. Beasley, An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure, Operations Research, vol.33, issue.1, pp.49-64, 1985.
DOI : 10.1287/opre.33.1.49

J. E. Beasley and A. Mingozzi, A new formulation for the two-dimensional orthogonal cutting problem, 1996.

N. Beldiceanu and M. Carlsson, New Filtering for the $\mathit{cumulative}$ Constraint in the Context of Non-Overlapping Rectangles, In Lecture Notes in Computer Science, vol.5015, pp.21-25, 2008.
DOI : 10.1007/978-3-540-68155-7_5

N. Beldiceanu, M. Carlsson, and S. Thiel, Sweep synchronization as a global propagation mechanism, Computers & Operations Research, vol.33, issue.10, pp.2835-2851, 2006.
DOI : 10.1016/j.cor.2005.01.013
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.6427

G. Belov, V. Kartak, H. Rohling, and G. Scheithauer, One-dimensional relaxations and LP bounds for orthogonal packing, International Transactions in Operational Research, vol.3, issue.2, pp.745-766, 2009.
DOI : 10.1111/j.1475-3995.2009.00713.x

G. Belov and H. Rohling, A branch-and-price graph-theoretical algorithm for orthogonal-packing feasibility, p.139, 2009.

G. Belov and G. Scheithauer, Lower-dimensional bounds and a new model for higherdimensional orthogonal packing, 2007.

K. S. Booth and G. S. Lueker, Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms, Journal of Computer and System Sciences, vol.13, issue.3, pp.335-379, 1976.
DOI : 10.1016/S0022-0000(76)80045-1

M. A. Boschetti, A. Mingozzi, and E. Hadjiconstantinou, New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem, IMA Journal of Management Mathematics, vol.13, issue.2, pp.95-119, 2002.
DOI : 10.1093/imaman/13.2.95

A. Caprara and M. Monaci, On the two-dimensional Knapsack Problem, Operations Research Letters, vol.32, issue.1, pp.5-14, 2004.
DOI : 10.1016/S0167-6377(03)00057-9

A. Caprara and M. Monaci, Bidimensional packing by bilinear programming, Mathematical Programming, 2007.
DOI : 10.1007/11496915_28

A. Caprara, M. Monaci, and D. Vigo, An exact approach to the strip-packing problem, INFORMS Journal on Computing, vol.13, issue.3, pp.310-319, 2003.

J. Carlier and E. Néron, A new LP-based lower bound for the cumulative scheduling problem, European Journal of Operational Research, vol.127, issue.2, pp.363-382, 2000.
DOI : 10.1016/S0377-2217(99)00494-4

J. Carlier and E. Néron, On linear lower bounds for the resource constrained project scheduling problem, European Journal of Operational Research, vol.149, issue.2, pp.314-324, 2003.
DOI : 10.1016/S0377-2217(02)00763-4

J. Carlier and E. Néron, Computing redundant resources for the resource constrained project scheduling problem, European Journal of Operational Research, vol.176, issue.3, pp.1452-1463, 2007.
DOI : 10.1016/j.ejor.2005.09.034

C. S. Chen, S. M. Lee, and Q. S. Shen, An analytical model for the container loading problem, European Journal of Operational Research, vol.80, issue.1, pp.68-76, 1995.
DOI : 10.1016/0377-2217(94)00002-T

F. Clautiaux, C. Alves, and J. V. De-carvalho, A survey of dual-feasible and superadditive functions, Annals of Operations Research, vol.183, issue.6, 2008.
DOI : 10.1007/s10479-008-0453-8
URL : https://hal.archives-ouvertes.fr/inria-00522674

F. Clautiaux, J. Carlier, and A. Moukrim, A new exact method for the two-dimensional orthogonal packing problem, European Journal of Operational Research, vol.183, issue.3, pp.1196-1211, 2007.
DOI : 10.1016/j.ejor.2005.12.048

F. Clautiaux, A. Jouglet, J. Carlier, and A. Moukrim, A new constraint programming approach for the orthogonal packing problem, Computers & Operations Research, vol.35, issue.3, pp.944-959, 2008.
DOI : 10.1016/j.cor.2006.05.012
URL : https://hal.archives-ouvertes.fr/hal-01378284

F. Clautiaux, A. Moukrim, and J. Carlier, New data-dependent dual-feasible functions and lower bounds for a two-dimensional bin-packing problem, International Journal of Production Research, vol.39, issue.2, 2007.
DOI : 10.1287/mnsc.44.3.388

G. Desaulniers, J. Desrosiers, and M. M. Solomon, Column generation, 2005.
DOI : 10.1007/b135457

H. Dyckhoff, A typology of cutting and packing problems, European Journal of Operational Research, vol.44, issue.2, pp.145-159, 1990.
DOI : 10.1016/0377-2217(90)90350-K

G. Fasano, S. P. Fekete, and J. Schepers, MIP-based heuristic for non-standard 3d-packing A new exact algorithm for general orthogonal ddimensional knapsack problems, Algorithms ? ESA '97, pp.291-310, 1997.

S. P. Fekete and J. Schepers, On more-dimensional packing i : Modeling, 1997.

S. P. Fekete and J. Schepers, On more-dimensional packing ii : Bounds, 1997.

S. P. Fekete and J. Schepers, New Classes of Lower Bounds for Bin Packing Problems, Integer Programming and Combinatorial Optimization (IPCO 98, pp.257-270, 1998.
DOI : 10.1007/3-540-69346-7_20

S. P. Fekete and J. Schepers, New Classes of Lower Bounds for Bin Packing Problems, Mathematical Programming, vol.91, pp.11-31, 2001.
DOI : 10.1007/3-540-69346-7_20

S. P. Fekete and J. Schepers, A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing, Mathematics of Operations Research, vol.29, issue.2, pp.353-368, 2004.
DOI : 10.1287/moor.1030.0079

S. P. Fekete, J. Schepers, and J. Van-der-veen, An Exact Algorithm for Higher-Dimensional Orthogonal Packing, Operations Research, vol.55, issue.3, pp.569-587, 2007.
DOI : 10.1287/opre.1060.0369
URL : http://arxiv.org/abs/cs/0604045

E. P. Ferreira and J. F. Oliveira, Fekete and Schepers??? Graph-based Algorithm for the Two-Dimensional Orthogonal Packing Problem Revisited, Gabler, 2008.
DOI : 10.1007/978-3-8349-9777-7_2

D. R. Fulkerson and O. A. Gross, Incidence matrices and interval graphs, Pacific Journal of Mathematics, vol.15, issue.3, pp.835-855, 1965.
DOI : 10.2140/pjm.1965.15.835
URL : http://projecteuclid.org/download/pdf_1/euclid.pjm/1102995572

F. Vanderbeck, Branching in branch-and-price: a generic scheme, Mathematical Programming, vol.139, issue.1, pp.1-46, 2010.
DOI : 10.1007/s10107-009-0334-1
URL : https://hal.archives-ouvertes.fr/inria-00311274

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

P. C. Gilmore and A. J. Hoffman, A Linear Programming Approach to the Cutting Stock Problem???Part II, Operations Research, vol.11, issue.6, pp.849-859, 1961.
DOI : 10.1287/opre.11.6.863

P. C. Gilmore and A. J. Hoffman, A Linear Programming Approach to the Cutting Stock Problem???Part II, Operations Research, vol.11, issue.6, pp.863-888, 1963.
DOI : 10.1287/opre.11.6.863

P. C. Gilmore and A. J. Hoffman, A characterization of comparability graphs and of interval graphs, Journal canadien de math??matiques, vol.16, issue.0, pp.539-548, 1964.
DOI : 10.4153/CJM-1964-055-5

E. Hadjiconstantinou and N. Christofides, An exact algorithm for general, orthogonal, two-dimensional knapsack problems, European Journal of Operational Research, vol.83, issue.1, pp.39-56, 1995.
DOI : 10.1016/0377-2217(93)E0278-6

E. Huang and R. E. Korf, New improvements in optimal rectangle packing, IJCAI, pp.511-516, 2009.

C. Joncour, S. Michel, R. Sadykov, D. Sverdlov, and F. Vanderbeck, Column Generation based Primal Heuristics, Electronic Notes in Discrete Mathematics, pp.695-702, 2010.
DOI : 10.1016/j.endm.2010.05.088
URL : https://hal.archives-ouvertes.fr/hal-00790610

C. Joncour and A. Pêcher, Consecutive ones matrices for multi-dimensional orthogonal packing problems, 20th International Symposium of Mathematical Programming, 2009.
DOI : 10.1016/j.endm.2010.05.042
URL : https://hal.archives-ouvertes.fr/hal-00453404

C. Joncour and A. Pêcher, Consecutive ones matrices for multi-dimensional orthogonal packing problems, International Symposium on Combinatorial Optimization Electronic Notes in Discrete Mathematics, pp.327-334, 2010.
DOI : 10.1016/j.endm.2010.05.042
URL : https://hal.archives-ouvertes.fr/hal-00453404

C. Joncour, A. Pêcher, P. Pesneau, and F. Vanderbeck, Mathematical programming formulations for the orthogonal 2d knapsack problem : a survey, 9 e congrès annuel de la Sociéte française de Recherche Opérationnelle et d'Aide à la Décision, 2008.

C. Joncour, A. Pêcher, and P. Valicov, MPQ-trees for orthogonal packing problem, International Symposium on Combinatorial Optimization Electronic Notes in Discrete Mathematics, pp.423-429, 2010.
DOI : 10.1016/j.endm.2010.05.054
URL : https://hal.archives-ouvertes.fr/hal-00453408

R. E. Korf, Optimal rectangle packing, ICAPS, pp.142-149, 2004.
DOI : 10.1007/s10479-008-0463-6

R. E. Korf, Optimal rectangle packing, ICAPS, pp.287-295, 2003.
DOI : 10.1007/s10479-008-0463-6

N. Korte and R. Möhring, An Incremental Linear-Time Algorithm for Recognizing Interval Graphs, SIAM Journal on Computing, vol.18, issue.1, pp.68-81, 1989.
DOI : 10.1137/0218005

S. Martello and D. Vigo, Exact Solution of the Two-Dimensional Finite Bin Packing Problem, Management Science, vol.44, issue.3, pp.388-399, 1998.
DOI : 10.1287/mnsc.44.3.388

S. Olariu, An optimal greedy heuristic to color interval graphs, Information Processing Letters, vol.37, issue.1, pp.21-25, 1991.
DOI : 10.1016/0020-0190(91)90245-D

H. Onodera, Y. Taniguchi, and K. Tamaru, Branch-and-bound placement for building block layout, 28th ACM, pp.433-439, 1991.

M. Padberg, Packing small boxes into a big box, Mathematical Methods of Operations Research (ZOR), vol.52, issue.1, pp.1-21, 2000.
DOI : 10.1007/s001860000066

D. Pisinger and M. Sigurd, Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem, INFORMS Journal on Computing, vol.19, issue.1, pp.36-51, 2007.
DOI : 10.1287/ijoc.1060.0181

G. Scheithauer, LP-based bounds for the container and multi-container loading problem, International Transactions in Operational Research, vol.27, issue.83, pp.199-213, 1999.
DOI : 10.1007/BF01719835

H. Simonis and B. O. Sullivan, Search Strategies for Rectangle Packing, 2008.
DOI : 10.1007/978-3-540-85958-1_4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.177.704

R. D. Tsai, E. M. Malstorm, and H. D. Meeks, A Two-Dimensional Palletizing Procedure for Warehouse Loading Operations, IIE Transactions, vol.13, issue.4, pp.418-425, 1988.
DOI : 10.1147/rd.165.0462

P. Van-hentenryck, Scheduling and packing in the constraint language cc(fd) In in intelligent scheduling, 1994.

F. Vanderbeck and L. A. Wolsey, Reformulation and decomposition of integer programs 50 Years of Integer Programming Two algorithms for constrained two-dimensional cutting stock problems, Operations Research, vol.31, pp.431-502573, 1983.

G. Wäscher, H. Haußner, and H. Schuman, An improved typology of cutting and packing problems, European Journal of Operational Research, vol.183, issue.3, pp.1109-1130, 2007.
DOI : 10.1016/j.ejor.2005.12.047

T. Achterberg and T. Berthold, Improving the feasibility pump, Discrete Optimization, vol.4, issue.1, pp.77-86, 2007.
DOI : 10.1016/j.disopt.2006.10.004

Y. Agarwal, K. Mathur, and H. M. Salkin, A set-partitioning-based exact algorithm for the vehicle routing problem, Networks, vol.19, issue.7, pp.731-749, 1989.
DOI : 10.1002/net.3230190702

Ö. Ahuja, J. B. Ergun, A. P. Orlin, and . Punnen, A survey of very large-scale neighborhood search techniques, Discrete Applied Mathematics, vol.123, issue.1-3, pp.75-10299, 2002.
DOI : 10.1016/S0166-218X(01)00338-9

A. Chabrier, E. Danna, and C. L. Pape, Coopération entre génération de colonnes et recherche locale appliquées au problème de routage de véhicules, Huitièmes Journées Nationales sur la résolution de Problèmes NP-Complets (JNPC), pp.83-97, 2002.

E. Danna, E. Rothberg, and C. L. Pape, Exploring relaxation induced neighborhoods to improve MIP solutions, Mathematical Programming, vol.9, issue.1, pp.71-90, 2005.
DOI : 10.1007/s10107-004-0518-7

Z. Degraeve and R. Jans, A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times, Operations Research, vol.55, issue.5, pp.909-920, 2007.
DOI : 10.1287/opre.1070.0404

E. Albert, M. Fernandes-muritiba, E. Iori, P. Malaguti, and . Toth, Algorithms for the bin packing problem with conflicts, INFORMS Journal on Computing, pp.1090-0355, 2009.

M. Fischetti, F. Glover, and A. Lodi, The feasibility pump, Mathematical Programming, vol.106, issue.1, pp.91-104, 2005.
DOI : 10.1007/s10107-004-0570-3

M. Fischetti and A. Lodi, Local branching, Mathematical Programming, vol.98, issue.1-3, pp.23-47, 2002.
DOI : 10.1007/s10107-003-0395-5

M. Gamache, F. Soumis, G. Marquis, and J. Desrosiers, A Column Generation Approach for Large-Scale Aircrew Rostering Problems, Operations Research, vol.47, issue.2, pp.247-263, 1999.
DOI : 10.1287/opre.47.2.247

[. B. Gunluk, T. Kimbrel, L. Ladanyi, B. Schieber, and G. B. Sorkin, Vehicle Routing and Staffing for Sedan Service, Transportation Science, vol.40, issue.3, pp.313-326, 2006.
DOI : 10.1287/trsc.1050.0122

M. L. Harvey and . Ginsberg, Limited discrepancy search, Proc. IJCAI-95, pp.607-613, 1995.

S. Michel, Optimisation des tournées de véhicules combinées à la gestion de stock, 2006.