References

1

F. Barahona, M. Grötschel, M. Jünger and G. Reinelt, ``An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design'', Operations Research 36, 493 - 513 (1988).

2

F. Barahona, R. Mahjoub, ``On the Cut Polytope'', Math. Programming 36, 157 - 173 (1986).

3

M. Conforti, M. R. Rao and A. Sassano, ``The Equipartition Polytope I: Formulations, Dimension and Basic Facets'', Mathematical Programming 49, 49 - 70 (1990).

4

M. Conforti, M. R. Rao and A. Sassano, ``The Equipartition Polytope II: Valid Inequalities and Facets'', Mathematical Programming 49, 71 - 90 (1990).

5

D. Coppersmith and P. Raghavan ``Multidimensional on-line bin packing: Algorithms and worst-case analysis'' Operation Research Letters 8, 17-20 (1989).

6

M. Deza and M. Laurent, ``A Survey of the Known Facets of the Cut Cone'', Technical Report 91722, Institut für Ökonometrie und Operations Research, Universität Bonn (1991).

7

C. E. Ferreira, ``On Combinatorial Optimization Problems Arising in Computer System Design'', PhD. Dissertation, Technische Universität Berlin (1994).

8

C. E. Ferreira, M. Grötschel, S. Kiefl, C. Krispenz, A. Martin and R. Weismantel, ``Some Integer Programs Arising in the Design of Main Frame Computers'', Zeitschrift für Operations Research 38, 77 - 100 (1993).

9

C. E. Ferreira, A. Martin, C. C. de Souza, R. Weismantel and L. A. Wolsey, ``Formulations and Valid Inequalities for Node Capacitated Graph Partitioning'', in preparation (1993).

10

C. E. Ferreira, A. Martin, C. C. de Souza, R. Weismantel and L. A. Wolsey, ``A Branch and Cut Algorithm for Node Capacitated Graph Partitioning'', in preparation (1993).

11

P. C. Gilmore and R. E. Gomory, ``A Linear Programming Approach to the Cutting Stock Problem'', Operations Research 9, 849 - 859 (1961).

12

P. C. Gilmore and R. E. Gomory, ``A Linear Programming Approach to the Cutting Stock Problem-Part II'', Operations Research 11, 863 - 888 (1963).

13

M. Grötschel, M. Jünger and G. Reinelt, ``Via Minimization with Pin Preassignments and Layer Preference'', Zeitschrift für Angewandte Mathematik und Mechanik 69, 393 - 399 (1989).

14

M. Grötschel and Y. Wakabayashi,``A Cutting Plane Algorithm for a Clustering Problem'', Mathematical Programming B 45, 59 - 96 (1989).

15

M. Grötschel and Y. Wakabayashi,``Facets for the Clique Partitioning Polytope'', Mathematical Programming A 47, 367 - 388 (1990).

16

E. L. Johnson, A. Mehrotra and G. L. Nemhauser, ``Min-Cut Clustering'', Mathematical Programming B/ 62, 133 - 151 (1993).

17

K. Li and K-H. Cheng ``On three-dimensional packing'' SIAM Journal on Computing 19, 847-867 (1990).

18

K. Li and K-H. Cheng. ``Static job scheduling in partitionable mesh connected systems'' Journal on Parallel and Distributed Computing 10, 152-159 (1990).

19

K. Li and K-H. Cheng. ``Heuristic algorithms for on-line packing in three dimensions'' Journal of Algorithms 13, 589-605 (1992).

20

F. K. Miyazawa. ``Algoritmos de Empacotamento Tridimensional: novas estrat'egias e an'alises de desempenho'' Master's Thesis, Universidade de São Paulo, Brazil (1993).

21

F. K. Miyazawa and Y. Wakabayashi, ``Algorithms for the tridimensional packing problem'' in preparation.

22

Scheithauer ``A three-dimensional bin packing algorithm'' Journal of Information Processing and Cybernetics EIK (formerly Elektronische Informationsverarbeitung und Kybernetik) 27, 263-271 (1991).

23

C. C. de Souza, ``The Graph Equipartition Problem: Optimal Solutions, Extensions and Applications'', PhD. Dissertation, Universitè Catholique de Louvain la Neuve (1993).

24

C. C. de Souza, R. Keunings, L.A. Wolsey and O. Zone, ``A New Approach to Minimising the Frontwidth in Finite Element Calculations'', Discussion paper 9255, Universitè Catholique de Louvain la Neuve (1992).

25

R. Weismantel, ``Plazieren von Zellen: Analyse und Lösung eines quadratischen 0/1-Optimierungsproblems'', PhD. Dissertation, Technische Universität Berlin (1992) (in German).