Packing of concave polyhedra with continuous rotations using nonlinear optimisation.

European Journal of Operational Research(2018)

引用 66|浏览16
暂无评分
摘要
•Tools to describe non-overlapping and distance constraints for concave polyhedra.•NLP-model of the packing problem of concave polyhedra with continuous rotations.•A compaction algorithm to search for local extrema of the polyhedron packing problem.
更多
查看译文
关键词
Packing,Concave polyhedra,Continuous rotations,Mathematical modelling,Nonlinear optimisation
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要