摘要
将一个长方体切割成单位立方体,在两次切割之间可以任意重新堆置各切缺,最少切多少次才能完成?本文解决了这个问题,而且本文采用的方法对于n维超长方体的切割问题也是适用的。
Cutting a rectangular parallelpiped into unit cubes, in which the pieces can be rearranged between two consecutive cuttings, what is the least times of cutting?The method used here applies to the similar problem about n-dimension hyperrectangles
出处
《北京轻工业学院学报》
1990年第1期93-95,共3页
Journal of Beijing Institute of Light Industry
关键词
组合优化
长方体
单位立方体
combinatorial optimization, rectangular paralielpiped, unit cube
