Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation

We investigate several two-dimensional guillotine cutting stock problems and their variants in which orthogonal rotations are allowed. We first present two dynamic programming based algorithms for the Rectangular Knapsack (RK) problem and its variants in which the patterns must be staged. The first algorithm solves the recurrence formula proposed by Beasley; the second algorithm - for staged patterns - also uses a recurrence formula. We show that if the items are not so small compared to the dimensions of the bin, then these algorithms require polynomial time. Using these algorithms we solved all instances of the RK problem found at the OR-LIBRARY, including one for which no optimal solution was known. We also consider the Two-dimensional Cutting Stock problem. We present a column generation based algorithm for this problem that uses the first algorithm above mentioned to generate the columns. We propose two strategies to tackle the residual instances. We also investigate a variant of this problem where the bins have different sizes. At last, we study the Two-dimensional Strip Packing problem. We also present a column generation based algorithm for this problem that uses the second algorithm above mentioned where staged patterns are imposed. In this case we solve instances for two-, three- and four-staged patterns. We report on some computational experiments with the various algorithms we propose in this paper. The results indicate that these algorithms seem to be suitable for solving real-world instances. We give a detailed description (a pseudo-code) of all the algorithms presented here, so that the reader may easily implement these algorithms. (c) 2007 Elsevier B.V. All rights reserved.

False-positive results of a rapid K39-based strip test and Chagas disease

Background: The definitive diagnosis of visceral. leishmaniasis (VL) requires invasive procedures with demonstration of amastigotes in tissue or promastigotes in culture. Unfortunately, these approaches require laboratory materials not available in poor countries where the disease is endemic. The correct diagnosis of VL is important, and made more difficult by the fact that several common tropical diseases such as malaria, disseminated tuberculosis, and enteric fever share the same clinical presentation. Serological tests have been developed to replace parasitological diagnosis in the field. A commercially available K39-based strip test for VL has been developed for this purpose. The endemic area of leishmaniasis in Brazil overlaps the endemic area of Chagas disease, a disease that can cause false-positive serological test results. The aim of this study was to evaluate the incidence of false-positive exams using a rapid test for VL in patients with Chagas disease. Methods: A rapid test based on the recombinant K39 antigen of Leishmania was used in: (1) 30 patients with confirmed Chagas disease, (2) 30 patients with a serological diagnosis of Chagas disease by ELISA, indirect immunofluorescence, indirect hemagglutination, and chemiluminescence, (3) 30 healthy patients from a non-endemic area as the control group, (4) 30 patients with confirmed VL, and (5) 20 patients with proved cutaneous leishmaniasis. Results: The sensitivity and specificity of the rapid strip test were 100% when compared with healthy volunteers and those with confirmed Chagas disease. One false-positive result occurred in the group with Chagas disease diagnosed by serological tests (specificity of 96%). Conclusion: The rapid test based on recombinant K39 is a useful diagnostic assay, and a false-positive result rarely occurs in patients with a serological diagnosis of Chagas disease. (C) 2008 International Society for Infectious Diseases. Published by Elsevier Ltd. All rights reserved.