Please use this identifier to cite or link to this item:
Type: Artigo de Periódico
Title: Packing Ellipsoids By Nonlinear Optimization
Author: Birgin
EG; Lobato
RD; Martinez
Abstract: In this paper, continuous and differentiable nonlinear programming models and algorithms for packing ellipsoids in the n-dimensional space are introduced. Two different models for the non-overlapping and models for the inclusion of ellipsoids within half-spaces and ellipsoids are presented. By applying a simple multi-start strategy combined with a clever choice of starting guesses and a nonlinear programming local solver, illustrative numerical experiments are presented.
Subject: Cutting And Packing Ellipsoids
Nonlinear Programming
Numerical Experiments
Citation: Journal Of Global Optimization. SPRINGER, n. 65, n. 4, p. 709 - 743.
Rights: fechado
Identifier DOI: 10.1007/s10898-015-0395-z
Date Issue: 2016
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
File SizeFormat 
000379862500004.pdf1.17 MBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.