Abstract Balanced sampling is a random method for sample selection, the use of which preferable when auxiliary information available all units population. However, implementing balanced can be challenging task, and this due in part to computational efforts required necessity respect balancing constraints inclusion probabilities. In present paper, new algorithm selecting samples proposed. This i...

This article presents the use of the Simulated Annealing algorithm with a heuristic to solve the waste minimization problem in roll cutting programming, in this case, paper. Client orders, which vary in weight, width, and external and internal diameter, are fully satisfied. Several tests were performed with real data from a paper company in which an average of 30% waste reduction and 100% reduc...

Disclaimer/Complaints regulations If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library: http://uba.uva.nl/en/contact, or a letter to: Library of ...

The first polynomial-time algorithm to approximate (with arbitrary precision) the permanent of a non-negative matrix was presented by Jerrum, Sinclair and Vigoda. They designed a simulated annealing algorithm with a running time of O∗(n26) for 0/1 matrices. Subsequently, they improved their analysis, resulting in a O∗(n10) time algorithm. We present a O∗(n7) time algorithm. Our improvement come...