A branch-and-cut algorithm for the irregular strip packing problem with uncertain demands (2022)
Source: International Transactions in Operational Research. Unidade: ICMC
Subjects: PROGRAMAÇÃO ESTOCÁSTICA, HEURÍSTICA, ALGORITMOS
ABNT
QUEIROZ, Layane Rodrigues de Souza; ANDRETTA, Marina. A branch-and-cut algorithm for the irregular strip packing problem with uncertain demands. International Transactions in Operational Research, Chichester, 2022. Disponível em: < https://doi.org/10.1111/itor.13122 > DOI: 10.1111/itor.13122.APA
Queiroz, L. R. de S., & Andretta, M. (2022). A branch-and-cut algorithm for the irregular strip packing problem with uncertain demands. International Transactions in Operational Research. doi:10.1111/itor.13122NLM
Queiroz LR de S, Andretta M. A branch-and-cut algorithm for the irregular strip packing problem with uncertain demands [Internet]. International Transactions in Operational Research. 2022 ;Available from: https://doi.org/10.1111/itor.13122Vancouver
Queiroz LR de S, Andretta M. A branch-and-cut algorithm for the irregular strip packing problem with uncertain demands [Internet]. International Transactions in Operational Research. 2022 ;Available from: https://doi.org/10.1111/itor.13122