Cutting rectangles avoiding rectangular defects

Applied Mathematics Letters

Volumn 12, Issue 6, 1999, Pages 135-138

  Twisselmann, U ^a  

^a IBM   (Germany)

Author keywords

Cutting problem; Maximum empty rectangle problem; Steel industry

Indexed keywords

EID: 0042859837     PISSN: 08939659     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0893-9659(99)00092-0     Document Type: Article

References (3)

1. A. Naamad, D.T. Lee and W.-L. Hsu, On the maximum empty rectangle problem, Discrete Applied Mathematics 8, 267-277 (1984).
2. A. Datta and K. Krithivasan, Efficient algorithms for the maximum empty rectangle problem in shared memory and other architectures, In 1990 International Conference on Parallel Processing, (Edited by P. Yew), Vol. 3, pp. III-344-III-345, (1990).
3. T. Hari Krishna Prasad and C. Pandurangan, New parallel algorithms for the maximum empty rectangle problem, Journal of Parallel and Distributed Computing (to appear).