Generating unconstrained two-dimensional non-guillotine cutting patterns by a Recursive Partitioning Algorithm (2012)
- Authors:
- USP affiliated authors: BIRGIN, ERNESTO JULIAN GOLDBERG - IME ; LOBATO, RAFAEL DURBANO - IME
- Unidade: IME
- DOI: 10.1057/jors.2011.6
- Assunto: PROGRAMAÇÃO DINÂMICA
- Language: Inglês
- Imprenta:
- Source:
- Título: Journal of the Operational Research Society
- ISSN: 0160-5682
- Volume/Número/Paginação/Ano: v. 63, p. 183-200, 2012
- Este periódico é de acesso aberto
- Este artigo NÃO é de acesso aberto
-
ABNT
BIRGIN, Ernesto Julian Goldberg e LOBATO, Rafael Durbano e MORABITO, R. Generating unconstrained two-dimensional non-guillotine cutting patterns by a Recursive Partitioning Algorithm. Journal of the Operational Research Society, v. 63, p. 183-200, 2012Tradução . . Disponível em: https://doi.org/10.1057/jors.2011.6. Acesso em: 13 fev. 2026. -
APA
Birgin, E. J. G., Lobato, R. D., & Morabito, R. (2012). Generating unconstrained two-dimensional non-guillotine cutting patterns by a Recursive Partitioning Algorithm. Journal of the Operational Research Society, 63, 183-200. doi:10.1057/jors.2011.6 -
NLM
Birgin EJG, Lobato RD, Morabito R. Generating unconstrained two-dimensional non-guillotine cutting patterns by a Recursive Partitioning Algorithm [Internet]. Journal of the Operational Research Society. 2012 ; 63 183-200.[citado 2026 fev. 13 ] Available from: https://doi.org/10.1057/jors.2011.6 -
Vancouver
Birgin EJG, Lobato RD, Morabito R. Generating unconstrained two-dimensional non-guillotine cutting patterns by a Recursive Partitioning Algorithm [Internet]. Journal of the Operational Research Society. 2012 ; 63 183-200.[citado 2026 fev. 13 ] Available from: https://doi.org/10.1057/jors.2011.6 - Orthogonal packing of identical rectangles within isotropic convex regions
- Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern
- Ellipsoid packing
- Algoritmos para problemas de programação não-linear com variáveis inteiras e contínuas
- An augmented Lagrangian method with finite termination
- Packing circles within ellipses
- Spectral projected gradient and variable metric methods for optimization with linear inequalities
- Sparse Projected-Gradient Method As a Linear-Scaling Low-Memory Alternative to Diagonalization in Self-Consistent Field Electronic Structure Calculations
- The boundedness of penalty parameters in an augmented Lagrangian method with constrained subproblems
- On acceleration schemes and the choice of subproblem’s constraints in augmented Lagrangian methods
Informações sobre o DOI: 10.1057/jors.2011.6 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
