Cutting circles and polygons from area-minimizing rectangles
From MaRDI portal
Publication:1029696
DOI10.1007/s10898-007-9274-6zbMath1169.90434OpenAlexW2039355562MaRDI 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 optimizationmixed integer programmingpacking problemassignmentcutting stock problemshape constraintsdesign problemnon-overlap constraints
Related Items
Quasi-phi-functions and optimal packing of ellipses, Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges, Minimal surface convex hulls of spheres, A review of recent advances in global optimization, Packing ellipsoids by nonlinear optimization, A formulation space search heuristic for packing unequal circles in a fixed size circular container, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, Computing tight bounds via piecewise linear functions through the example of circle cutting problems, High density packings of equal circles in rectangles with variable aspect ratio, Packing non-identical circles within a rectangle with open length, A nonlinear programming model with implicit variables for packing ellipsoids, GLOMIQO: global mixed-integer quadratic optimizer, Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2, Packing convex polygons in minimum-perimeter convex hulls, Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts, Packing circles into perimeter-minimizing convex hulls, Symmetry-breaking constraints for packing identical rectangles within polyhedra, A global optimization point of view to handle non-standard object packing problems, Does any convex quadrilateral have circumscribed ellipses?, Packing congruent hyperspheres into a hypersphere, A heuristic approach for packing identical rectangles in convex regions, Optimized Object Packings Using Quasi-Phi-Functions, Packing ellipsoids into volume-minimizing rectangular boxes, Packing of concave polyhedra with continuous rotations using nonlinear optimisation, 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, Mixed integer quadratically-constrained programming model to solve the irregular strip packing problem with continuous rotations, Packing circles within ellipses, Solving the problem of packing equal and unequal circles in a circular container, Optimal clustering of a pair of irregular objects, Sparsest balanced packing of irregular 3D objects in a cylindrical container, QPLIB: a library of quadratic programming instances, Irregular packing problems: a review of mathematical models, Price-and-verify: a new algorithm for recursive circle packing using Dantzig-Wolfe decomposition, Recursive circle packing problems, Optimized packing clusters of objects in a rectangular container, Column enumeration based decomposition techniques for a class of non-convex MINLP problems, Packing Problems in Space Solved by CPLEX: An Experimental Analysis, Model Development and Optimization for Space Engineering: Concepts, Tools, Applications, and Perspectives, Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications
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
