Packing convex polygons in minimum-perimeter convex hulls
From MaRDI portal
Publication:2679237
DOI10.1007/s10898-022-01194-4OpenAlexW4297909578MaRDI QIDQ2679237
Luis Infante, Josef Kallrath, Alexandr Pankratov, Tatiana E. Romanova, Igor S. Litvinchev
Publication date: 19 January 2023
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-022-01194-4
global optimizationconvex hullcomputational geometrynon-convex nonlinear programmingnon-overlap constraintsperimeter minimizationpolygon packing problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quasi-phi-functions and optimal packing of ellipses
- Lagrangian heuristic for a class of the generalized assignment problems
- Combinatorial configurations in balance layout optimization problems
- Logistic constraints in container loading problems: the impact of complete shipment conditions
- Bundling three convex polygons to minimize area or perimeter
- Cutting circles and polygons from area-minimizing rectangles
- Localization of the optimal solution and a posteriori bounds for aggregation
- How good are convex hull algorithms?
- A hybrid LP/NLP paradigm for global optimization relaxations
- Minimal surface convex hulls of spheres
- Optimal packing of general ellipses in a circle
- Introduction to cutting and packing optimization. Problems, modeling approaches, solution methods
- Modeling and optimization in space engineering. State of the art and new challenges
- Packing of concave polyhedra with continuous rotations using nonlinear optimisation
- A polyhedral branch-and-cut approach to global optimization
- Placement problems for irregular objects: mathematical modeling, optimization and applications
- Optimal clustering of a pair of irregular objects
- Packing ovals in optimized regular polygons
- Packing ellipsoids in an optimized cylinder
- A fully general, exact algorithm for nesting irregular shapes
- Mathematical model and efficient algorithms for object packing problem
- Packing ellipses in an optimized convex polygon
- Irregular packing problems: a review of mathematical models
- Optimized ellipse packings in regular polygons
- The geometry of nesting problems: a tutorial
- Packing circles into perimeter-minimizing convex hulls
- Aligning two convex figures to minimize area or perimeter
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- An improved typology of cutting and packing problems
- A tutorial in irregular shape packing problems
- Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons
- MINIMUM AREA CONVEX PACKING OF TWO CONVEX POLYGONS
- Solving Non-standard Packing Problems by Global Optimization and Heuristics
