Cutting circles and polygons from area-minimizing rectangles
From MaRDI portal
Publication:1029696
DOI10.1007/s10898-007-9274-6zbMath1169.90434MaRDI QIDQ1029696
Publication date: 13 July 2009
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-007-9274-6
global optimization; mixed integer programming; packing problem; assignment; cutting stock problem; shape constraints; design problem; non-overlap constraints
Related Items
Packing circles within ellipses, GLOMIQO: global mixed-integer quadratic optimizer, Packing congruent hyperspheres into a hypersphere, A heuristic approach for packing identical rectangles in convex regions, A review of recent advances in global optimization, Solving the problem of packing equal and unequal circles in a circular container, Column enumeration based decomposition techniques for a class of non-convex MINLP problems, Symmetry-breaking constraints for packing identical rectangles within polyhedra, A global optimization point of view to handle non-standard object packing problems, A fully general, exact algorithm for nesting irregular shapes, Cutting ellipses from area-minimizing rectangles, ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations, Packing non-identical circles within a rectangle with open length
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New approaches to circle packing in a square. With program codes.
- An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms
- Minimum perimeter rectangles that enclose congruent non-overlapping circles
- Column enumeration based decomposition techniques for a class of non-convex MINLP problems
- Packing different-sized circles into a rectangular container
- Packing problems
- On genetic algorithms for the packing of polygons
- Integrated container loading software for pulp and paper industry
- Reformulation and convex relaxation techniques for global optimization
- A typology of cutting and packing problems
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- A mathematical model and a solution method for the problem of placing various-sized circles into a strip
- Finding all solutions of nonlinearly constrained systems of equations
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- Minimizing the object dimensions in circle and sphere packing problems
- Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization
- Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints
- Greedy algorithms for packing unequal circles into a rectangular container
