A. R. Ahuja, T. L. Magnanti, J. B. Orlin, and M. R. Reddy, Applications of network optimization"; Chapter 1 of Network Models, Handbook of Operation Research and Management Science 7, pp.1-83, 1995.

T. [. Ahuja and J. B. Magnanti, ORLIN : « Network Flows : Theory, Algorithms and Applications, 1993.

T. [. Balakrishnan, P. Magnanti, and . Mirchandani, Designing Hierarchical Survivable Networks, Operations Research, vol.46, issue.1, pp.116-130, 1998.
DOI : 10.1287/opre.46.1.116
URL : http://dspace.mit.edu/bitstream/1721.1/5115/1/OR-291-94.pdf

D. Bienstock and O. Unluk, Capacitated Network Design???Polyhedral Structure and Computation, INFORMS Journal on Computing, vol.8, issue.3, pp.243-259, 1996.
DOI : 10.1287/ijoc.8.3.243
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.43.1012

A. [. Boschetti, MINGOZZI: The two dimensional finite bin packing problem, part 1: new bounds for the oriented case, pp.27-42, 2003.

G. [. Burke, G. Kendall, and . Whitwell, A New Placement Heuristic for the Orthogonal Stock-Cutting Problem, Operations Research, vol.52, issue.4, pp.655-671, 2004.
DOI : 10.1287/opre.1040.0109

M. [. Caprara, 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

M. [. Caprara and M. Locatelli, MONACCI: Bilinear packing by bilinear programming, IPCO 05 Conf. Proc. LNCS 3509, pp.377-391, 2005.
DOI : 10.1007/11496915_28

C. [. Christophides and . Whitlock, An Algorithm for Two-Dimensional Cutting Problems, Operations Research, vol.25, issue.1, pp.30-44, 1977.
DOI : 10.1287/opre.25.1.30

C. [. Christophides, WHITLOCK : « Network synthesis with connectivity constraint : a survey » ; Operat Research, pp.705-723, 1981.

A. [. Clautiaux, J. Jouglet, and A. Carlier, 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

E. Coffman, M. Garey, and D. Johnson, Approximation algorithms for bin packing: an updated survey Algorithm design for computer system design, pp.49-106, 1984.

G. Dahl and M. , STOER : « A polyedral approach to multicommodity survivable network design » ; Numerisch Mathematik 68, pp.149-167, 1994.

S. Dell-'amico and D. Martello, A lower bound for the non-oriented two-dimensional bin packing problem, Discrete Applied Mathematics, vol.118, issue.1-2, pp.13-24, 2002.
DOI : 10.1016/S0166-218X(01)00253-0

J. El, A. Hayek, S. Moukrim, and . Negre, New resolution algorithms and pretreaments or the twodimensional bin-packing problem, Computers and Operations Research, vol.35, pp.3184-3201, 2008.

O. Faroe, D. Pisinger, and M. Zachariensen, Guided Local Search for the Three-Dimensional Bin-Packing Problem, INFORMS Journal on Computing, vol.15, issue.3, pp.267-283, 2003.
DOI : 10.1287/ijoc.15.3.267.16080

J. [. Fekete, 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

J. [. Fekete, A General Framework for Bounds for Higher-Dimensional Orthogonal Packing Problems, Mathematical Methods of Operational Research, vol.60, issue.2, pp.311-329, 2004.
DOI : 10.1007/s001860400376

M. Garey and D. Johnsson, Computers and Intractability, a guide to the theory of NPcompleteness, 1979.

N. [. Hadjiconstantinou, 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

A. Lodi, S. Martello, and D. Vigo, Heuristic and metaheuristic approaches for a class of twodimensional bin packing problems, INFORMS Journ. Computing, vol.11, pp.347-357, 1999.

S. [. Lodi and D. Martello, VIGO: Recent advances on two dimensional bin packing problems; Disc, Applied Maths, vol.123, pp.379-396, 2002.

D. [. Martello and . 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

. [. Minoux, Networks synthesis and optimum network design problems: Models, solution methods and applications, Networks, vol.14, issue.3, pp.313-360, 1989.
DOI : 10.1002/net.3230190305

L. [. Mirchandani and . Francis, Discrete Location Theory, 1990.

D. [. Pardalos and . Du, Network design: connectivity and facility location"; DIMACS Series 40, 1998.