Subject
Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering
Reference59 articles.
1. Polygon decomposition for efficient construction of Minkowski sums;Agarwal;Computational Geometry,2002
2. A branch and bound algorithm for cutting and packing irregularly shaped pieces;Alvarez-Valdes;International Journal of Production Economics,2013
3. Art, R. (1966). An approach to the two-dimensional irregular cutting stock problem. IBM Cambridge Centre. Technical Report 36.008,
4. Algorithms for nesting with defects;Baldacci;Discrete Applied Mathematics,2014
5. A beam search approach to solve the convex irregular bin packing problem with guillotine cuts;Bennell;European Journal of Operational Research,2018
Cited by
101 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献