Packing algorithms for orthoblocks in $E^3$

V. N. Martynchik   ; N. N. Metel'skii   ; J.-M. Proth

Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 42 (2002) no. 9, pp. 1445-1455

Bibliographie

[1] Dyckhoff H., “A typology of cutting and packing problems”, European J. Operat. Res., 44 (1990), 145–160 | DOI | MR

[2] Dyckhoff H., Scheithauer G., Terno J., Cutting and packing: an annotated bibliography, Preprint Math-NM-08-1996. TU Dresden, 1996

[3] Dyckhoff H., Finke U., Cutting and packing in production and distribution, Phys. Verlag, Heidelberg, 1992

[4] Dowsland K. A., Dowsland W. B., “Packing problems”, European J. Operat. Res., 56 (1992), 2–14 | DOI | Zbl

[5] Dowsland K. A., Dowsland W. B., “Solution approaches to irregular nesting problems”, European J. Operat. Res., 84:3 (1995), 506–521 | DOI | Zbl

[6] Cheng C. H., Feiring B. R., Cheng T. C. E., “The cutting stock problem – a survey”, Internat. J. Prod. Econ., 36 (1994), 291–305 | DOI

[7] Nelissen J., New approach to the pallet loading problem, Repts RWTH, Aachen, 1994

[8] Scheithauer G., Terno J., The G4-heuristic for the pallet loading problem, Preprint Math-NM-06-1995. TU Dresden, 1995 | MR

[9] Leontev V. K., “Diskretnye ekstremalnye zadachi”, Itogi nauki i tekhn. Ser. teor. veroyatnostei. Matem. statistika. Teor. kibernetika, 16, Nauka, M., 1979, 39–101

[10] Hifi M., Ouafi R., “A best-first branch-and-bound algorithm for orthogonal rectangular packing problems”, Internat. Trans. Operat. Res., 5:5 (1998), 345–356 | DOI

[11] Antonio J., Chauvet F., Chu C., Proth J. M., “The cutting stock problem with mixed objectives: Two heuristics based on dynamic programming”, European J. Operat. Res., 114 (1999), 395–402 | DOI | Zbl

[12] Terno J., Scheithauer G., Sommerweiss U., Riehme J., “An efficient approach for the multi-pallet loading problem”, European J. Operat. Res., 123 (2000), 372–381 | DOI | MR | Zbl

[13] Azarenok A. C., Klebanovich D. M., Krikun B. C. i dr., Avtomatizatsiya proektirovaniya SBIS. Metod ierarkhicheskoi generatsii eskiza topologicheskogo chertezha na osnove biblioteki fiksirovannykh raznogabaritnykh blokov, Preprint No 16(326), In-t matem. AN BSSR, Minsk, 1988

[14] Martynchik V. N., Metelskii N. N., Prot Zh. M., “Vychislenie parnykh razmeschenii geometricheskikh ob'ektov”, Zh. vychisl. matem. i matem. fiz., 40:5 (2000), 809–816 | MR | Zbl

[15] Metelskii N. N., Krikun B. C., Metod ierarkhicheskogo razmescheniya izoteticheskikh blokov, Preprint No 27 (427), In-t matem. AN BSSR, Minsk, 1990

[16] Burkard R. E., Miatselski M. M., “Volume maximization and orthoconvex approximation of orthogons”, Computing, 63 (1999), 317–330 | DOI | MR | Zbl

[17] Murata H., Fujiyoshi K., Nakatake S., Kajitani Y., Proc. IEEE/ACM Internat. Conf. on Computer-Aided Design (ICCAD'95), 1995

[18] Preparata F., Sheimos M., Vychislitelnaya geometriya: Vvedenie, Mir, M., 1989 | MR | Zbl

[19] Ottmann T., Soisalon-Soininen E., Wood D., “Partitioning and separating sets of orthogonal polygons”, Information Sciences, 42 (1987), 31–49 | DOI | MR | Zbl

[20] Nicholl T. M., Lee D. T., Liao Y. Z., Wong C. K., “On the X-Y convex hull of a set of X-Y polygons”, BIT, 23 (1983), 456–471 | DOI | Zbl

[21] Wang P. Y., “Two algorithms for constrained two-dimensional cutting stock problems”, Operat. Res., 31:3 (1983), 573–586 | DOI | Zbl

[22] Kristofides H., Teoriya grafov. Algoritmicheskii podkhod, Mir, M., 1978 | MR

[23] Gabow H., Implementation of algorithms for maximum on nonbipartite graphs, Ph.D. Thesis, Stanford Univ., 1973

[24] Feinberg V. Z., Geometricheskie zadachi mashinnoi grafiki BIS, Radio i svyaz, M., 1987

[25] Chazell B., Drysdale R. L., Lee D. T., “Computing the largest empty rectangle”, SIAM J. Comput., 15:1 (1986), 300–315 | DOI | MR | Zbl

[26] Metelskii H. H., Martynchik B. H., Osnovnye klassy obobschennoi vypuklosti dlya izoteticheskikh oblastei, Preprint No 14 (464), In-t matem. AN BSSR, Minsk, 1991