Method of sentinels for packing items within arbitrary convex regions (2006)
- Authors:
- USP affiliated authors: BIRGIN, ERNESTO JULIAN GOLDBERG - IME ; MASCARENHAS, WALTER FIGUEIREDO - IME ; RONCONI, DEBORA PRETTI - EP
- Unidades: IME; EP
- DOI: 10.1057/palgrave.jors.2602067
- Assunto: PROGRAMAÇÃO LINEAR
- Language: Inglês
- Imprenta:
- Source:
- Título: Journal of the Operational Research Society
- ISSN: 0160-5682
- Volume/Número/Paginação/Ano: v. 57, n. 6, p. 735-746, 2006
- Este periódico é de acesso aberto
- Este artigo NÃO é de acesso aberto
-
ABNT
BIRGIN, Ernesto Julian Goldberg et al. Method of sentinels for packing items within arbitrary convex regions. Journal of the Operational Research Society, v. 57, n. 6, p. 735-746, 2006Tradução . . Disponível em: https://doi.org/10.1057/palgrave.jors.2602067. Acesso em: 23 jan. 2026. -
APA
Birgin, E. J. G., Martinez, J. M., Mascarenhas, W. F., & Ronconi, D. P. (2006). Method of sentinels for packing items within arbitrary convex regions. Journal of the Operational Research Society, 57( 6), 735-746. doi:10.1057/palgrave.jors.2602067 -
NLM
Birgin EJG, Martinez JM, Mascarenhas WF, Ronconi DP. Method of sentinels for packing items within arbitrary convex regions [Internet]. Journal of the Operational Research Society. 2006 ; 57( 6): 735-746.[citado 2026 jan. 23 ] Available from: https://doi.org/10.1057/palgrave.jors.2602067 -
Vancouver
Birgin EJG, Martinez JM, Mascarenhas WF, Ronconi DP. Method of sentinels for packing items within arbitrary convex regions [Internet]. Journal of the Operational Research Society. 2006 ; 57( 6): 735-746.[citado 2026 jan. 23 ] Available from: https://doi.org/10.1057/palgrave.jors.2602067 - Using sentinels to detect intersections of convex and nonconvex polygons
- Metaheuristics for the online printing shop scheduling problem
- Optimizing the packing of cylinders into a rectangular container: a nonlinear approach
- A filtered beam search method for the m-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs
- MIP models for two-dimensional non-guillotine cutting problems with usable leftovers
- Metaheuristics for large-scale instances of the linear ordering problem
- Um algoritmo do tipo list scheduling para o problema flowshop minimizando o adiantamento e atraso das tarefas
- A forward-looking matheuristic approach for the multi-period two-dimensional non-guillotine cutting stock problem with usable leftovers
- Heuristic methods for the single machine scheduling problem with different ready times and a common due date
- Mixed Integer linear programming and constraint programming models for the online printing shop scheduling problem
Informações sobre o DOI: 10.1057/palgrave.jors.2602067 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
