Author:
Chekanin Vladislav A.,Chekanin Alexander V.
Publisher
Springer International Publishing
Reference20 articles.
1. Wascher G, Haubner H, Schumann H (2007) An improved typology of cutting and packing problems. EJOR 183(3):1109–1130
2. Bortfeldt A, Wascher G (2013) Constraints in container loading—a state-of-the-art review. EJOR 229(1):1–20
3. Garey M, Johnson D (1979) Computers intractability: a guide to the theory of NP-completeness. W.H.Freeman, San Francisco, p 338
4. Bournez O, Maler O, Pnueli A (1999) Orthogonal polyhedra: representation and computation. International workshop on hybrid systems: computation and control. Springer, Berlin, Heidelberg, pp 46–60
5. Chekanin VA, Chekanin AV (2018) Algorithms for the formation of orthogonal polyhedrons of arbitrary dimension in the cutting and packing problems. Vestnik MSTU «STANKIN» 3:126–130 (in Russian)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献