科研之友
微信
新浪微博
Facebook
分享链接
摘要
In this paper a fast algorithm based on a recursive function to solve a design problem for the precast industry is presented. The problem can be summarized as follows: for a given span in the direction of the supporting beams, how many hollow core units of suitable length are necessary to cover exactly all the span, since the cuts in the units can be made just in some admissible intervals because of some production constraints and the geometry is a customer requirement. The mathematical model and the algorithm are here discussed, proving that the computing time of the recursive function is O(n).
- 出版日期2010-2
