Packing polyhedra within convex sets

DOI10.5540/TCAM.2025.026.E01823MaRDI QIDQ7395614zbMATH OpenFDO

Authors Hector Flores Callisaya, Elvis R. V. Kari

Publication date 2025

Published in Trends in Computational and Applied Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.5540/TCAM.2025.026.E01823

Mathematics Subject Classification ID

Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Nonlinear programming (90C30)

Cites work

• An improved typology of cutting and packing problems
• Applied functional analysis. Functional analysis, Sobolev spaces and elliptic differential equations
• Complexity and approximation of an area packing problem
• scientific article; zbMATH DE number 3227205 (Why is no real title available?)
• JuMP 1.0: recent improvements to a modeling language for mathematical optimization
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• Optimal packing and covering in the plane are NP-complete
• Packing circles within ellipses
• Packing convex polygons in minimum-perimeter convex hulls
• Symmetry-breaking constraints for packing identical rectangles within polyhedra

This page was built for publication: Packing polyhedra within convex sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7395614)