Dynamic programming and column generation based approaches for two-dimensional guillotine cutting problems (2004)
- Authors:
- USP affiliated authors: WAKABAYASHI, YOSHIKO - IME ; CINTRA, GLAUBER FERREIRA - IME
- Unidade: IME
- DOI: 10.1007/978-3-540-24838-5_13
- Subjects: PROGRAMAÇÃO DINÂMICA; PROGRAMAÇÃO LINEAR
- Keywords: Discretization Point; Column Generation; Orthogonal Rotation; Cutting Problem
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título: Proceedings
- Conference titles: International Workshop on Experimental and Efficient Algorithms - WEA
- Este periódico é de acesso aberto
- Este artigo NÃO é de acesso aberto
-
ABNT
CINTRA, Glauber Ferreira e WAKABAYASHI, Yoshiko. Dynamic programming and column generation based approaches for two-dimensional guillotine cutting problems. 2004, Anais.. Berlin: Springer, 2004. Disponível em: https://doi.org/10.1007/978-3-540-24838-5_13. Acesso em: 20 jan. 2026. -
APA
Cintra, G. F., & Wakabayashi, Y. (2004). Dynamic programming and column generation based approaches for two-dimensional guillotine cutting problems. In Proceedings. Berlin: Springer. doi:10.1007/978-3-540-24838-5_13 -
NLM
Cintra GF, Wakabayashi Y. Dynamic programming and column generation based approaches for two-dimensional guillotine cutting problems [Internet]. Proceedings. 2004 ;[citado 2026 jan. 20 ] Available from: https://doi.org/10.1007/978-3-540-24838-5_13 -
Vancouver
Cintra GF, Wakabayashi Y. Dynamic programming and column generation based approaches for two-dimensional guillotine cutting problems [Internet]. Proceedings. 2004 ;[citado 2026 jan. 20 ] Available from: https://doi.org/10.1007/978-3-540-24838-5_13 - A hybrid algorithm for the one-dimensional cutting stock problem
- Algoritmos híbridos para problemas de corte unidimensional
- Algoritmos para problemas de corte de guilhotina bidimensional
- Approximation algorithms for the orthogonal Z-oriented three-dimensional packing problem
- Selfish 2D bin packing game
- Packing entering sets in kernel systems
- Balanced connected partitions of graphs: approximation, parameterization and lower bounds
- Grafos e otimização combinatória
- Hypotraceable digraphs
- Some approximation results for the maximum agreement forest problem
Informações sobre o DOI: 10.1007/978-3-540-24838-5_13 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
3035189.pdf |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
