Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation (2008)
- Authors:
- USP affiliated authors: WAKABAYASHI, YOSHIKO - IME ; XAVIER, EDUARDO CÂNDIDO - EACH
- Unidades: IME; EACH
- DOI: 10.1016/j.ejor.2007.08.007
- Subjects: PROGRAMAÇÃO DINÂMICA; ALGORITMOS; EMPACOTAMENTO E COBERTURA
- Keywords: Column generation; Cutting stock; Guillotine cutting; Two-dimensional packing; Strip packing
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título: European Journal of Operational Research
- ISSN: 0377-2217
- Volume/Número/Paginação/Ano: v. 191, n. 1, p. 61-85, 2008
- Este periódico é de acesso aberto
- Este artigo NÃO é de acesso aberto
-
ABNT
CINTRA, Glauber Ferreira et al. Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation. European Journal of Operational Research, v. 191, n. 1, p. 61-85, 2008Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2007.08.007. Acesso em: 28 jan. 2026. -
APA
Cintra, G. F., Miyazawa, F. K., Wakabayashi, Y., & Xavier, E. C. (2008). Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation. European Journal of Operational Research, 191( 1), 61-85. doi:10.1016/j.ejor.2007.08.007 -
NLM
Cintra GF, Miyazawa FK, Wakabayashi Y, Xavier EC. Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation [Internet]. European Journal of Operational Research. 2008 ; 191( 1): 61-85.[citado 2026 jan. 28 ] Available from: https://doi.org/10.1016/j.ejor.2007.08.007 -
Vancouver
Cintra GF, Miyazawa FK, Wakabayashi Y, Xavier EC. Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation [Internet]. European Journal of Operational Research. 2008 ; 191( 1): 61-85.[citado 2026 jan. 28 ] Available from: https://doi.org/10.1016/j.ejor.2007.08.007 - On the structure of the monotone asymmetric travelling salesman polytope II: hypotraceable facets
- Polyhedral and computational results on the k-hop connected dominating set problem
- Polynomial-time approximation schemes for circle packing problems
- Selfish 2D bin packing game
- Packing entering sets in kernel systems
- Approximation algorithms for the orthogonal Z-oriented three-dimensional packing problem
- Some approximation results for the maximum agreement forest problem
- On the structure of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets
- The maximum agreement forest problem: approximation algorithms and computational experiments
- Approximation results on balanced connected partitions of graphs
Informações sobre o DOI: 10.1016/j.ejor.2007.08.007 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
