Bin packing and cutting stock problems: Mathematical models and exact algorithms
By Maxence Delorme, Manuel Iori, Silvano Martello. European Journal of Operational Research, 2016
365 citations recorded by the source corpus.
We review the most important mathematical models and algorithms developed for the exact solution of the one-dimensional bin packing and cutting stock problems, and experimentally evaluate, on state-of-the art computers, the performance of the main available software tools.
Subfields: Computer Graphics and Computer-Aided Design, Industrial and Manufacturing Engineering
View Paper: https://www.semanticscholar.org/paper/887a453fe28c57cea09a4f2f7ea9d86b6ddff94e
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Graphics and Computer-Aided Design
In Industrial and Manufacturing Engineering
Citations in the corpus
- A Tutorial On the design, experimentation and application of metaheuristic algorithms to real-World optimization problems (2021, methodology): “Apart from these generic approaches, valuable works of this sort can be found in the literature devoted to some specific knowledge domains, such as the ones presented in [39] and [40].”