A matheuristic approach with nonlinear subproblems for large-scale packing of ellipsoids

DOI10.1016/j.ejor.2018.07.006zbMath1403.90565OpenAlexW2865797307WikidataQ129539234 ScholiaQ129539234MaRDI QIDQ1991149

Ernesto G. Birgin, Rafael D. Lobato

Publication date: 30 October 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2018.07.006

zbMATH Keywords

algorithmsnonlinear programmingellipsoidspackingmatheuristic

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Related Items

Packing ellipsoids in an optimized cylinder, Sparse balanced layout of spherical voids in three-dimensional domains, A support tool for planning classrooms considering social distancing between students

Uses Software

• ALGENCAN
• Packmol

Cites Work

• Quasi-phi-functions and optimal packing of ellipses
• Packing ellipsoids by nonlinear optimization
• Packing ellipsoids into volume-minimizing rectangular boxes
• Neighbor list collision-driven molecular dynamics simulation for nonspherical hard particles. I: Algorithmic details
• Neighbor list collision-driven molecular dynamics simulation for nonspherical hard particles. II: Applications to ellipses and ellipsoids
• Cutting ellipses from area-minimizing rectangles
• A nonlinear programming model with implicit variables for packing ellipsoids
• Packing Ellipsoids with Overlap
• Numerical optimization methods for packing equal orthogonally oriented ellipses in a rectangular domain
• Brownian Motion of an Ellipsoid
• On Augmented Lagrangian Methods with General Lower-Level Constraints
• Practical Augmented Lagrangian Methods for Constrained Optimization