Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing (2012)
- Authors:
- Autor USP: WAKABAYASHI, YOSHIKO - IME
- Unidade: IME
- DOI: 10.1016/j.cor.2011.03.011
- Assunto: ALGORITMOS
- Keywords: Guillotine cutting; Three-dimensional cutting stock; Unbounded knapsack; Strip packing; Column generation
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título do periódico: Computers & Operations Research
- ISSN: 0305-0548
- Volume/Número/Paginação/Ano: v. 39, n. 2, p. 200-212, 2012
- Este periódico é de assinatura
- Este artigo é de acesso aberto
- URL de acesso aberto
- Cor do Acesso Aberto: hybrid
- Licença: publisher-specific-oa
-
ABNT
QUEIROZ, Thomaz A et al. Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing. Computers & Operations Research, v. 39, n. 2, p. 200-212, 2012Tradução . . Disponível em: https://doi.org/10.1016/j.cor.2011.03.011. Acesso em: 12 maio 2024. -
APA
Queiroz, T. A., Miyazawa, F. K., Wakabayashi, Y., & Xavier, E. C. (2012). Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing. Computers & Operations Research, 39( 2), 200-212. doi:10.1016/j.cor.2011.03.011 -
NLM
Queiroz TA, Miyazawa FK, Wakabayashi Y, Xavier EC. Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing [Internet]. Computers & Operations Research. 2012 ; 39( 2): 200-212.[citado 2024 maio 12 ] Available from: https://doi.org/10.1016/j.cor.2011.03.011 -
Vancouver
Queiroz TA, Miyazawa FK, Wakabayashi Y, Xavier EC. Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing [Internet]. Computers & Operations Research. 2012 ; 39( 2): 200-212.[citado 2024 maio 12 ] Available from: https://doi.org/10.1016/j.cor.2011.03.011 - Sobre grafos hamiltonianos
- Cube packing
- Parametric on-line algorithms for packing rectangles and boxes
- Two- and three-dimensional parametric packing
- Three-dimensional packings with rotations
- On the structure of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets
- Polynomial-time approximation schemes for circle packing problems
- Path decompositions of regular graphs with prescribed girth
- A cutting plane algorithm for a clustering problem
- Partitioning a graph into balanced connected classes: Formulations, separation and experiments
Informações sobre o DOI: 10.1016/j.cor.2011.03.011 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
