Search Results - subject:"cutting and packing"

Mathematical models based on decision hypergraphs for designing a storage cabinet

Marques, Luis; Clautiaux, François; Froger, Aurélien - In: European journal of operational research : EJOR 321 (2025) 1, pp. 57-74

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

Worst-case analysis of heuristic approaches for the temporal bin packing problem with fire-ups

Martinovic, John; Strasdat, Nico - In: Annals of Operations Research 333 (2023) 1, pp. 481-499

can be arbitrarily bad. By doing so, we (i) identify a new open problem in cutting and packing, and (ii) establish another …

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

Smart nesting: estimating geometrical compatibility in the nesting problem using graph neural networks

Abdou, Kirolos; Mohammed, Osama; Eskandar, George; … - In: Journal of Intelligent Manufacturing 35 (2023) 6, pp. 2811-2827

Reducing material waste and computation time are primary objectives in cutting and packing problems (C &P). A solution …

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

An introduction to the two-dimensional rectangular cutting and packing problem

Oliveira, Óscar; Gamboa, Dorabela; Silva, Elsa - In: International transactions in operational research : a … 30 (2023) 6, pp. 3238-3266

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

Worst-case analysis of heuristic approaches for the temporal bin packing problem with fire-ups

Martinovic, John; Strasdat, Nico - In: Annals of Operations Research 333 (2023) 1, pp. 481-499

can be arbitrarily bad. By doing so, we (i) identify a new open problem in cutting and packing, and (ii) establish another …

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

Smart nesting: estimating geometrical compatibility in the nesting problem using graph neural networks

Abdou, Kirolos; Mohammed, Osama; Eskandar, George; … - In: Journal of Intelligent Manufacturing 35 (2023) 6, pp. 2811-2827

Reducing material waste and computation time are primary objectives in cutting and packing problems (C &P). A solution …

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

An introduction to stochastic bin packing-based server consolidation with conflicts

Martinovic, John; Hähnel, Markus; Scheithauer, Guntram; … - In: Top : an official journal of the Spanish Society of … 30 (2022) 2, pp. 296-331

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

A note on the integrality gap of cutting and skiving stock instances : why 4/3 is an upper bound for the divisible case?

Martinovic, John - In: 4OR : quarterly journal of the Belgian, French and … 20 (2022) 1, pp. 85-104

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

Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups

Martinovic, John; Strasdat, Nico; Valério de Carvalho, … - In: Optimization Letters 16 (2021) 8, pp. 2333-2358

The aim of this letter is to design and computationally test several improvements for the compact integer linear programming (ILP) formulations of the temporal bin packing problem with fire-ups (TBPP-FU). This problem is a challenging generalization of the classical bin packing problem in which...

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

An introduction to stochastic bin packing-based server consolidation with conflicts

Martinovic, John; Hähnel, Markus; Scheithauer, Guntram; … - In: TOP 30 (2021) 2, pp. 296-331

The energy consumption of large-scale data centers or server clusters is expected to grow significantly in the next couple of years contributing to up to 13% of the worldwide energy demand in 2030. As the involved processing units require a disproportional amount of energy when they are idle,...

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