Cutting ellipses from area-minimizing rectangles
From MaRDI portal
Publication:2250089
Recommendations
Cites work
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- A New Verified Optimization Technique for the "Packing Circles in a Unit Square" Problems
- A typology of cutting and packing problems
- An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms
- Column enumeration based decomposition techniques for a class of non-convex MINLP problems
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Cutting circles and polygons from area-minimizing rectangles
- Finding all solutions of nonlinearly constrained systems of equations
- GLOMIQO: global mixed-integer quadratic optimizer
- Greedy randomized adaptive search procedures
- Interval methods for verifying structural optimality of circle packing configurations in the unit square
- Optimal packings of two ellipses in a square
- Polylithic modeling and solution approaches using algebraic modeling systems
- Reformulation and convex relaxation techniques for global optimization
- Semi-infinite programming
- Semi-Infinite Programming: Theory, Methods, and Applications
Cited in
(24)- Cutting circles and polygons from area-minimizing rectangles
- A matheuristic approach with nonlinear subproblems for large-scale packing of ellipsoids
- Properties, extensions and application of piecewise linearization for Euclidean norm optimization in \(\mathbb{R}^2\)
- Packing ovals in optimized regular polygons
- Packing ellipsoids in an optimized cylinder
- A fully general, exact algorithm for nesting irregular shapes
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Packing ellipses in an optimized convex polygon
- QPLIB: a library of quadratic programming instances
- Optimized packing clusters of objects in a rectangular container
- Optimized ellipse packings in regular polygons
- A nonlinear programming model with implicit variables for packing ellipsoids
- Rigorous packing of unit squares into a circle
- Quasi-phi-functions and optimal packing of ellipses
- Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges
- Packing ellipsoids by nonlinear optimization
- 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
- Optimized object packings using quasi-phi-functions
- Packing ellipsoids into volume-minimizing rectangular boxes
- Decomposition algorithm for irregular placement problems
- The concept of modeling packing and covering problems using modern computational geometry software
- Mixed-integer nonlinear and continuous optimization formulations for aircraft conflict avoidance via heading and speed deviations
- VOROPACK-D: real-time disk packing algorithm using Voronoi diagram
This page was built for publication: Cutting ellipses from area-minimizing rectangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2250089)
