Search Results - subject:"Cutting /Packing"

Cutting and packing problems under uncertainty : literature review and classification framework

Salem, Khadija Hadj; Silva, Elsa; Oliveira, José F. - In: International transactions in operational research : a … 30 (2023) 6, pp. 3329-3360

Persistent link: https://www.econbiz.de/10014328012

An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem

Libralesso, Luc; Fontan, Florian - In: European journal of operational research : EJOR 291 (2021) 3, pp. 883-893

Persistent link: https://www.econbiz.de/10012495374

A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem

Martin, Mateus; Morabito, Reinaldo; Munari, Pedro - In: Computers & operations research : and their … 115 (2020), pp. 1-19

Persistent link: https://www.econbiz.de/10012162784

An EDA for the 2D knapsack problem with guillotine constraint

Borgulya, István - In: Central European journal of operations research : CEJOR … 27 (2019) 2, pp. 329-356

Persistent link: https://www.econbiz.de/10011994345

Rectangle blanket problem : binary integer linear programming formulation and solution algorithms

Demiröz, Barış Evrim; Altınel, İ. Kuban; Akarun, Lale - In: European journal of operational research : EJOR 277 (2019) 1, pp. 62-83

Persistent link: https://www.econbiz.de/10012014810

An exact algorithm for the two-dimensional stage-unrestricted guillotine cutting/packing decision problem

Fleszar, Krzysztof - In: INFORMS journal on computing : JOC 28 (2016) 4, pp. 703-720

Persistent link: https://www.econbiz.de/10011617555

A branch & bound algorithm for cutting and packing irregularly shaped pieces

Alvarez-Valdes, Ramon; Martinez, A.; Tamarit, J. M. - In: International journal of production economics 145 (2013) 2, pp. 463-477

Persistent link: https://www.econbiz.de/10010187908

Algorithms for the circular open dimension problem.

Akeb, Hakim; Hifi, Mhand - Centre d'Économie de la Sorbonne, Université Paris 1 … - 2007

the circular strip cutting/ packing problem. We first propose an open strip generation solution procedure that uses the …

Persistent link: https://www.econbiz.de/10005670892

A branch & bound algorithm for cutting and packing irregularly shaped pieces

Alvarez-Valdes, R.; Martinez, A.; Tamarit, J.M. - In: International Journal of Production Economics 145 (2013) 2, pp. 463-477

Cutting and packing problems involving irregular shapes, usually known as Nesting Problems, are common in industries ranging from clothing and footwear to furniture and shipbuilding. Research publications on these problems are relatively scarce compared with other cutting and packing problems...

Persistent link: https://www.econbiz.de/10010702871