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; IME; EP
- DOI: 10.1057/palgrave.jors.2602067
- Subjects: PROGRAMAÇÃO LINEAR
- Language: Inglês
- Imprenta:
- Source:
- Título do periódico: 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 assinatura
- Este artigo é de acesso aberto
- URL de acesso aberto
- Cor do Acesso Aberto: green
-
ABNT
BIRGIN, Ernesto Julian Goldberg; MARTINEZ, José Mário; MASCARENHAS, Walter Figueiredo; RONCONI, Débora Pretti. Method of sentinels for packing items within arbitrary convex regions. Journal of the Operational Research Society, London, v. 57, n. 6, p. 735-746, 2006. Disponível em: < http://dx.doi.org/10.1057/palgrave.jors.2602067 > DOI: 10.1057/palgrave.jors.2602067. -
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.Available from: http://dx.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.Available from: http://dx.doi.org/10.1057/palgrave.jors.2602067 - Mixed-Integer Programming Models for Flowshop Scheduling Problems Minimizing the Total Earliness and Tardiness
- Optimizing the packing of cylinders into a rectangular container: a nonlinear approach
- Metaheuristics for large-scale instances of the linear ordering problem
- Using sentinels to detect intersections of convex and nonconvex polygons
- MIP models for two-dimensional non-guillotine cutting problems with usable leftovers
- Heuristic methods for the single machine scheduling problem with different ready times and a common due date
- Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization
- List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility
- 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
- The multiperiod two-dimensional non-guillotine cutting stock problem with usable leftovers
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
