Funder
Fundação de Amparo à Pesquisa do Estado de São Paulo
Fundação de Amparo àí Pesquisa do Estado de São Paulo
Conselho Nacional de Desenvolvimento Científico e Tecnológico
Publisher
Springer Science and Business Media LLC
Reference38 articles.
1. Alvelos F, Chan T, Vilaça P, Gomes T, Silva E, Valério de Carvalho J (2009) Sequence based heuristics for two-dimensional bin packing problems. Eng Optim 41:773–791. https://doi.org/10.1080/03052150902835960
2. Arbib C, Marinelli F, Pizzuti A (2021) Number of bins and maximum lateness minimization in two-dimensional bin packing. Eur J Oper Res 291:101–113. https://doi.org/10.1016/j.ejor.2020.09.023
3. Arbib C, Marinelli F, Ventura P (2016) One-dimensional cutting stock with a limited number of open stacks: bounds and solutions from a new integer linear programming model. Int Trans Oper Res 23:47–63. https://doi.org/10.1111/itor.12134
4. Baptiste P (2005). Simple MIP formulations to minimize the maximum number of open stacks. In Smith BM, & Gent IP (Eds.), Constraint modelling challenge 2005. Edinburgh. https://ipg.host.cs.st-andrews.ac.uk/challenge/
5. Beasley JE (1985) Algorithms for unconstrained two-dimensional guillotine cutting. J Oper Res Soc 36:297. https://doi.org/10.2307/2582416